diff options
| author | Jabier Arraiza Cenoz <jabier.arraiza@marker.es> | 2013-09-30 09:38:37 +0000 |
|---|---|---|
| committer | Jabiertxof <jtx@jtx.marker.es> | 2013-09-30 09:38:37 +0000 |
| commit | acf5c7612afc02aee6ddf079d2ea77e13bb82e1b (patch) | |
| tree | 8af7a0de9007c10f5e3a8d00676b162e35a74929 /src/libcola/cycle_detector.cpp | |
| parent | update to trunk (diff) | |
| parent | Reduce tools-switcher code, add description for node and select toos. (diff) | |
| download | inkscape-acf5c7612afc02aee6ddf079d2ea77e13bb82e1b.tar.gz inkscape-acf5c7612afc02aee6ddf079d2ea77e13bb82e1b.zip | |
Update to trunk
(bzr r11950.1.156)
Diffstat (limited to 'src/libcola/cycle_detector.cpp')
| -rw-r--r-- | src/libcola/cycle_detector.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/libcola/cycle_detector.cpp b/src/libcola/cycle_detector.cpp index 89a2ccaae..11e24a0ba 100644 --- a/src/libcola/cycle_detector.cpp +++ b/src/libcola/cycle_detector.cpp @@ -53,7 +53,7 @@ void CycleDetector::make_matrix() { assert(traverse.empty()); // from the edges passed, fill the adjacency matrix - for (ei = edges->begin(); ei != edges->end(); ei++) { + for (ei = edges->begin(); ei != edges->end(); ++ei) { anEdge = *ei; // the matrix is indexed by the first vertex of the edge // the second vertex of the edge is pushed onto another @@ -241,7 +241,7 @@ bool CycleDetector::find_node(std::vector<Node *> *& list, unsigned k) { } pair< bool, vector<unsigned>::iterator > CycleDetector::find_node(std::vector<unsigned>& list, unsigned k) { - for (vector<unsigned>::iterator ti = traverse.begin(); ti != traverse.end(); ti++) { + for (vector<unsigned>::iterator ti = traverse.begin(); ti != traverse.end(); ++ti) { if (*ti == k) { return pair< bool, vector<unsigned>::iterator >(true, ti); } } |