diff options
author | Misha Brukman <brukman+llvm@gmail.com> | 2003-10-10 17:57:28 +0000 |
---|---|---|
committer | Misha Brukman <brukman+llvm@gmail.com> | 2003-10-10 17:57:28 +0000 |
commit | cf00c4ab3ba308d45d98c5ccab87362cf802facb (patch) | |
tree | ba6836d8bf430b9b2fb55ad5fd6d2a02f18a9f32 /lib/Transforms/Instrumentation/ProfilePaths/Graph.cpp | |
parent | 452fea997232437902385e88366482b01957eeef (diff) |
Fix spelling.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@9027 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Transforms/Instrumentation/ProfilePaths/Graph.cpp')
-rw-r--r-- | lib/Transforms/Instrumentation/ProfilePaths/Graph.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/lib/Transforms/Instrumentation/ProfilePaths/Graph.cpp b/lib/Transforms/Instrumentation/ProfilePaths/Graph.cpp index 4f46e5b45c..8571dc819d 100644 --- a/lib/Transforms/Instrumentation/ProfilePaths/Graph.cpp +++ b/lib/Transforms/Instrumentation/ProfilePaths/Graph.cpp @@ -174,7 +174,7 @@ void Graph::addNode(Node *nd){ //add an edge //this adds an edge ONLY when -//the edge to be added doesn not already exist +//the edge to be added does not already exist //we "equate" two edges here only with their //end points void Graph::addEdge(Edge ed, int w){ @@ -497,7 +497,7 @@ void Graph::makeUnDirectional(){ //reverse the sign of weights on edges //this way, max-spanning tree could be obtained -//usin min-spanning tree, and vice versa +//using min-spanning tree, and vice versa void Graph::reverseWts(){ vector<Node *> allNodes=getAllNodes(); for(vector<Node *>::iterator NI=allNodes.begin(), NE=allNodes.end(); NI!=NE; |