equal
deleted
inserted
replaced
63 |
63 |
64 Digraph gr; |
64 Digraph gr; |
65 Node s, t, n; |
65 Node s, t, n; |
66 Arc e; |
66 Arc e; |
67 Value l; |
67 Value l; |
68 ignore_unused_variable_warning(l); |
68 ::lemon::ignore_unused_variable_warning(l); |
69 int k=3; |
69 int k=3; |
70 bool b; |
70 bool b; |
71 ignore_unused_variable_warning(b); |
71 ::lemon::ignore_unused_variable_warning(b); |
72 BF::DistMap d(gr); |
72 BF::DistMap d(gr); |
73 BF::PredMap p(gr); |
73 BF::PredMap p(gr); |
74 LengthMap length; |
74 LengthMap length; |
75 concepts::Path<Digraph> pp; |
75 concepts::Path<Digraph> pp; |
76 |
76 |
147 typedef Digraph::Node Node; |
147 typedef Digraph::Node Node; |
148 typedef concepts::ReadMap<Digraph::Arc,Value> LengthMap; |
148 typedef concepts::ReadMap<Digraph::Arc,Value> LengthMap; |
149 |
149 |
150 Digraph g; |
150 Digraph g; |
151 bool b; |
151 bool b; |
152 ignore_unused_variable_warning(b); |
152 ::lemon::ignore_unused_variable_warning(b); |
153 |
153 |
154 bellmanFord(g,LengthMap()).run(Node()); |
154 bellmanFord(g,LengthMap()).run(Node()); |
155 b = bellmanFord(g,LengthMap()).run(Node(),Node()); |
155 b = bellmanFord(g,LengthMap()).run(Node(),Node()); |
156 bellmanFord(g,LengthMap()) |
156 bellmanFord(g,LengthMap()) |
157 .predMap(concepts::ReadWriteMap<Node,Arc>()) |
157 .predMap(concepts::ReadWriteMap<Node,Arc>()) |