Changeset 1641:77f6ab7ad66f in lemon-0.x for demo/sub_graph_adaptor_demo.cc

Timestamp:

08/18/05 00:07:35 (19 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

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

Message:

Demos' documentations include the source.

File:

• demo/sub_graph_adaptor_demo.cc (modified) (1 diff)

demo/sub_graph_adaptor_demo.cc

@@ -22 +22 @@
 /// This program computes a maximum number of edge-disjoint shortest paths
 /// between nodes \c s and \c t.
-
+///
+/// \include sub_graph_adaptor_demo.cc
 
 // Use a DIMACS max flow file as input.