src/demo/sub_graph_wrapper_demo.cc
changeset 874 2195bc090dfe
parent 869 c19cf2007a7a
child 888 cc3590763f7f
equal deleted inserted replaced
1:91ce41fa78fa 2:5bd44bee73a4
     1 // -*- c++ -*-
     1 // -*- c++ -*-
     2 
     2 
     3 // Use a DIMACS max flow file as stdin.
     3 // Use a DIMACS max flow file as stdin.
     4 // sub_graph_wrapper_demo < dimacs_max_flow_file
     4 // sub_graph_wrapper_demo < dimacs_max_flow_file
     5 // This program computes a maximum number of disjoint shortest paths
     5 // This program computes a maximum number of edge-disjoint shortest paths
     6 // between s and t.
     6 // between s and t.
     7 
     7 
     8 #include <iostream>
     8 #include <iostream>
     9 #include <fstream>
     9 #include <fstream>
    10 
    10