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

Timestamp:

09/16/04 16:27:27 (20 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1169

Message:

more docs

File:

• src/demo/sub_graph_wrapper_demo.cc (modified) (4 diffs)

src/demo/sub_graph_wrapper_demo.cc

@@ -3 +3 @@
 // Use a DIMACS max flow file as stdin.
 // sub_graph_wrapper_demo < dimacs_max_flow_file
+// This program computes a maximum number of disjoint shortest paths
+// between s and t.
 
 #include <iostream>
@@ -47 +49 @@
   dijkstra.run(s);
 
+  // This map returns true exactly for those edges which are 
+  // tight w.r.t the length funcion and the potential 
+  // given by the dijkstra algorithm.
   typedef TightEdgeFilterMap<Graph, const Dijkstra::DistMap, LengthMap> 
     TightEdgeFilter;
@@ -52 +57 @@
 
   ConstMap<Node, bool> const_true_map(true);
+  // This graph contains exaclty the tight edges.
   typedef SubGraphWrapper<Graph, ConstMap<Node, bool>, TightEdgeFilter> SubGW;
   SubGW gw(g, const_true_map, tight_edge_filter);
@@ -57 +63 @@
   ConstMap<Edge, int> const_1_map(1);
   Graph::EdgeMap<int> flow(g, 0);
+  // Max flow between s and t in the graph of tight edges.
   Preflow<SubGW, int, ConstMap<Edge, int>, Graph::EdgeMap<int> > 
     preflow(gw, s, t, const_1_map, flow);