test/dijkstra_test.cc
changeset 1259 8b2d4e5d96e4
parent 1173 d216e1c8b3fa
parent 1257 3e711ee55d31
child 1270 dceba191c00d
equal deleted inserted replaced
16:a57edf0401a9 19:a9cd5a27598c
    63   Node s, t, n;
    63   Node s, t, n;
    64   Arc e;
    64   Arc e;
    65   VType l;
    65   VType l;
    66   int i;
    66   int i;
    67   bool b;
    67   bool b;
    68   ignore_unused_variable_warning(l,i,b);
    68   ::lemon::ignore_unused_variable_warning(l,i,b);
    69 
    69 
    70   DType::DistMap d(G);
    70   DType::DistMap d(G);
    71   DType::PredMap p(G);
    71   DType::PredMap p(G);
    72   LengthMap length;
    72   LengthMap length;
    73   Path<Digraph> pp;
    73   Path<Digraph> pp;
   162   typedef Digraph::Node Node;
   162   typedef Digraph::Node Node;
   163   typedef concepts::ReadMap<Digraph::Arc,VType> LengthMap;
   163   typedef concepts::ReadMap<Digraph::Arc,VType> LengthMap;
   164 
   164 
   165   Digraph g;
   165   Digraph g;
   166   bool b;
   166   bool b;
   167   ignore_unused_variable_warning(b);
   167   ::lemon::ignore_unused_variable_warning(b);
   168 
   168 
   169   dijkstra(g,LengthMap()).run(Node());
   169   dijkstra(g,LengthMap()).run(Node());
   170   b=dijkstra(g,LengthMap()).run(Node(),Node());
   170   b=dijkstra(g,LengthMap()).run(Node(),Node());
   171   dijkstra(g,LengthMap())
   171   dijkstra(g,LengthMap())
   172     .predMap(concepts::ReadWriteMap<Node,Arc>())
   172     .predMap(concepts::ReadWriteMap<Node,Arc>())