COIN-OR::LEMON - Graph Library

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


Ignore:
Timestamp:
08/31/04 15:40:07 (17 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:
1 edited

Legend:

Unmodified
Added
Removed
  • src/test/dijkstra_test.cc

    r774 r776  
    7676
    7777
    78   for(EdgeIt e(G); e==INVALID; ++e) {
     78  for(EdgeIt e(G); e!=INVALID; ++e) {
    7979    Node u=G.tail(e);
    8080    Node v=G.head(e);
     
    8787
    8888  ///\bug This works only for integer lengths
    89   for(NodeIt v(G); v==INVALID; ++v)
     89  for(NodeIt v(G); v!=INVALID; ++v)
    9090    if ( dijkstra_test.reached(v) ) {
    9191      Edge e=dijkstra_test.pred(v);
Note: See TracChangeset for help on using the changeset viewer.