demo/sub_graph_adaptor_demo.cc
changeset 1783 474666e89a2a
parent 1636 260ac104190f
child 1875 98698b69a902
equal deleted inserted replaced
5:edad2e576d60 6:a121ae1cf36c
    19 ///\file
    19 ///\file
    20 ///\brief Computing maximum number of edge-disjoint shortest paths
    20 ///\brief Computing maximum number of edge-disjoint shortest paths
    21 ///
    21 ///
    22 /// This program computes a maximum number of edge-disjoint shortest paths
    22 /// This program computes a maximum number of edge-disjoint shortest paths
    23 /// between nodes \c s and \c t.
    23 /// between nodes \c s and \c t.
    24 
    24 ///
       
    25 /// \include sub_graph_adaptor_demo.cc
    25 
    26 
    26 // Use a DIMACS max flow file as input.
    27 // Use a DIMACS max flow file as input.
    27 // sub_graph_adaptor_demo < dimacs_max_flow_file
    28 // sub_graph_adaptor_demo < dimacs_max_flow_file
    28 // Modified to eat lemon graph format! 
    29 // Modified to eat lemon graph format! 
    29 
    30