COIN-OR::LEMON - Graph Library

Changeset 1521:5815b382421b in lemon-0.x


Ignore:
Timestamp:
06/28/05 15:47:16 (14 years ago)
Author:
athos
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2006
Message:

Some modifications.

Files:
2 edited

Legend:

Unmodified
Added
Removed
  • demo/dijkstra_demo.cc

    r1435 r1521  
    33#include <lemon/list_graph.h>
    44#include <lemon/dijkstra.h>
     5//#include <lemon/bits/item_writer.h>
    56
    67using namespace lemon;
     
    4849    std::cout << "Dijkstra algorithm test..." << std::endl;
    4950
     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
    5057    Dijkstra<Graph, LengthMap> dijkstra_test(g,len);
    5158   
  • doc/quicktour.dox

    r1517 r1521  
    266266<tt>./lp_maxflow_demo < ?????????.lgf</tt>
    267267
    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.
     268where ?????????.lgf is a file in the lemon format containing a maxflow instance (designated "source", "target" nodes and "capacity" map on the edges).
     269
    272270
    273271
Note: See TracChangeset for help on using the changeset viewer.