COIN-OR::LEMON - Graph Library

Changeset 449:c30569f54936 in lemon-0.x for src/test


Ignore:
Timestamp:
04/27/04 20:33:39 (16 years ago)
Author:
jacint
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@597
Message:

debug

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/test/dijkstra_heap_test.cc

    r422 r449  
    5656  int error2=0;
    5757
    58   for(EdgeIt e=G.first(e); G.valid(e); G.next(e)) {
     58  EdgeIt e;
     59  for(G.first(e); G.valid(e); G.next(e)) {
    5960    Node u=G.tail(e);
    6061    Node v=G.head(e);
     
    6869  }
    6970
    70   for(NodeIt v=G.first(v); G.valid(v); G.next(v)) {
     71  NodeIt v;
     72  for(G.first(v); G.valid(v); G.next(v)) {
    7173    if ( dijkstra_test.reached(v) ) {
    7274      Edge e=dijkstra_test.pred(v);
     
    8991
    9092  std::cout <<
    91     "\n  Testing dijkstra.h with Fibonacci heap implementation fib_heap.h,"
     93    "\n\n  Testing dijkstra.h with Fibonacci heap implementation fib_heap.h,"
    9294            <<std::endl;
    9395  std::cout<<"  on a graph with " <<
     
    104106  error2=0;
    105107
    106   for(EdgeIt e=G.first(e); G.valid(e); G.next(e)) {
     108  for(G.first(e); G.valid(e); G.next(e)) {
    107109    Node u=G.tail(e);
    108110    Node v=G.head(e);
     
    116118  }
    117119
    118   for(NodeIt v=G.first(v); G.valid(v); G.next(v)) {
     120  for(G.first(v); G.valid(v); G.next(v)) {
    119121    if ( dijkstra_test2.reached(v) ) {
    120122      Edge e=dijkstra_test2.pred(v);
Note: See TracChangeset for help on using the changeset viewer.