Changeset 776:f2994a2b10b2 in lemon-0.x for src/test/dijkstra_test.cc

Timestamp:

08/31/04 15:40:07 (20 years ago)

Author:

Hegyi Péter

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1069

Message:

minlengthpaths_test.cc is already hugo++ comform and is compilable

File:

• src/test/dijkstra_test.cc (modified) (2 diffs)

src/test/dijkstra_test.cc

@@ -76 +76 @@
 
 
-  for(EdgeIt e(G); e==INVALID; ++e) {
+  for(EdgeIt e(G); e!=INVALID; ++e) {
     Node u=G.tail(e);
     Node v=G.head(e);
@@ -87 +87 @@
 
   ///\bug This works only for integer lengths
-  for(NodeIt v(G); v==INVALID; ++v)
+  for(NodeIt v(G); v!=INVALID; ++v)
     if ( dijkstra_test.reached(v) ) {
       Edge e=dijkstra_test.pred(v);