COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
05/07/04 13:57:34 (17 years ago)
Author:
marci
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@753
Message:

top-sort, dimacs mods.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/work/marci/top_sort_test.cc

    r557 r577  
    88#include <list_graph.h>
    99#include <hugo/graph_wrapper.h>
     10#include <hugo/maps.h>
    1011
    1112using namespace hugo;
     
    1718  {
    1819    std::list<Graph::Node> l;
    19     topSort(g, l);
     20    NullMap<Graph::Node, Graph::Edge> pred;
     21    topSort(g, l, pred);
    2022    std::cout << "Leaving order of dfs which is pretopological..." << std::endl;
    2123    for(std::list<Graph::Node>::const_iterator i=l.begin(); i!=l.end(); ++i) {
     
    2931    GW gw(g);
    3032    std::list<GW::Node> l;
    31     topSort(gw, l);
     33    NullMap<GW::Node, GW::Edge> pred;
     34    topSort(gw, l, pred);
    3235    std::cout << "Same in the revered oriented graph..." << std::endl;
    3336    for(std::list<GW::Node>::const_iterator i=l.begin(); i!=l.end(); ++i) {
Note: See TracChangeset for help on using the changeset viewer.