COIN-OR::LEMON - Graph Library

Changeset 869:c19cf2007a7a in lemon-0.x for src/demo


Ignore:
Timestamp:
09/16/04 16:27:27 (16 years ago)
Author:
marci
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1169
Message:

more docs

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/demo/sub_graph_wrapper_demo.cc

    r867 r869  
    33// Use a DIMACS max flow file as stdin.
    44// sub_graph_wrapper_demo < dimacs_max_flow_file
     5// This program computes a maximum number of disjoint shortest paths
     6// between s and t.
    57
    68#include <iostream>
     
    4749  dijkstra.run(s);
    4850
     51  // This map returns true exactly for those edges which are
     52  // tight w.r.t the length funcion and the potential
     53  // given by the dijkstra algorithm.
    4954  typedef TightEdgeFilterMap<Graph, const Dijkstra::DistMap, LengthMap>
    5055    TightEdgeFilter;
     
    5257
    5358  ConstMap<Node, bool> const_true_map(true);
     59  // This graph contains exaclty the tight edges.
    5460  typedef SubGraphWrapper<Graph, ConstMap<Node, bool>, TightEdgeFilter> SubGW;
    5561  SubGW gw(g, const_true_map, tight_edge_filter);
     
    5763  ConstMap<Edge, int> const_1_map(1);
    5864  Graph::EdgeMap<int> flow(g, 0);
     65  // Max flow between s and t in the graph of tight edges.
    5966  Preflow<SubGW, int, ConstMap<Edge, int>, Graph::EdgeMap<int> >
    6067    preflow(gw, s, t, const_1_map, flow);
Note: See TracChangeset for help on using the changeset viewer.