COIN-OR::LEMON - Graph Library

Changeset 422:ede61a3d229b in lemon-0.x


Ignore:
Timestamp:
04/26/04 19:05:22 (16 years ago)
Author:
jacint
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@562
Message:

macro erase

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/test/dijkstra_heap_test.cc

    r386 r422  
    44
    55//The input is a graph in standard dimacs format from the standard input (like
    6 //in /hugo_loc/testfiles/dimacs). It runs dijkstra.h on this graph with
    7 //both heaps, checking two postconditions:
     6//in /hugo_loc/testfiles/dimacs). It runs dijkstra.h on this graph with both
     7//heaps, checking two postconditions:
    88
    99//- if the edges e=uv of the shortest path tree reported by dijkstra.h have
     
    2121#include <bin_heap.h>
    2222#include <fib_heap.h>
    23 #include <for_each_macros.h>
    2423
    2524using namespace hugo;
     
    5756  int error2=0;
    5857
    59   FOR_EACH_LOC ( EdgeIt, e, G) {
     58  for(EdgeIt e=G.first(e); G.valid(e); G.next(e)) {
    6059    Node u=G.tail(e);
    6160    Node v=G.head(e);
     
    6968  }
    7069
    71   FOR_EACH_LOC ( NodeIt, v, G) {
     70  for(NodeIt v=G.first(v); G.valid(v); G.next(v)) {
    7271    if ( dijkstra_test.reached(v) ) {
    7372      Edge e=dijkstra_test.pred(v);
     
    105104  error2=0;
    106105
    107   FOR_EACH_LOC ( EdgeIt, e, G) {
     106  for(EdgeIt e=G.first(e); G.valid(e); G.next(e)) {
    108107    Node u=G.tail(e);
    109108    Node v=G.head(e);
     
    117116  }
    118117
    119   FOR_EACH_LOC ( NodeIt, v, G) {
     118  for(NodeIt v=G.first(v); G.valid(v); G.next(v)) {
    120119    if ( dijkstra_test2.reached(v) ) {
    121120      Edge e=dijkstra_test2.pred(v);
Note: See TracChangeset for help on using the changeset viewer.