Changeset 1521:5815b382421b in lemon-0.x
- Timestamp:
- 06/28/05 15:47:16 (19 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2006
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
demo/dijkstra_demo.cc
r1435 r1521 3 3 #include <lemon/list_graph.h> 4 4 #include <lemon/dijkstra.h> 5 //#include <lemon/bits/item_writer.h> 5 6 6 7 using namespace lemon; … … 48 49 std::cout << "Dijkstra algorithm test..." << std::endl; 49 50 51 // GraphWriter<ListGraph> writer(std::cout, g); 52 // writer.writeEdgeMap("capacity", length); 53 // writer.writeNode("source", s); 54 // writer.writeNode("target", t); 55 // writer.run(); 56 50 57 Dijkstra<Graph, LengthMap> dijkstra_test(g,len); 51 58 -
doc/quicktour.dox
r1517 r1521 266 266 <tt>./lp_maxflow_demo < ?????????.lgf</tt> 267 267 268 where ?????????.lgf is a file in the lemon format containing a maxflow instance (designated "source", "target" nodes and "capacity" map). 269 270 271 See the whole code in \ref lp_demo.cc. 268 where ?????????.lgf is a file in the lemon format containing a maxflow instance (designated "source", "target" nodes and "capacity" map on the edges). 269 272 270 273 271
Note: See TracChangeset
for help on using the changeset viewer.