1 //======================================================================= 2 // Copyright 2013 University of Warsaw. 3 // Authors: Piotr Wygocki 4 // 5 // Distributed under the Boost Software License, Version 1.0. (See 6 // accompanying file LICENSE_1_0.txt or copy at 7 // http://www.boost.org/LICENSE_1_0.txt) 8 //======================================================================= 9 10 #include <boost/graph/successive_shortest_path_nonnegative_weights.hpp> 11 #include <boost/graph/find_flow_cost.hpp> 12 13 #include "../test/min_cost_max_flow_utils.hpp" 14 main()15int main() 16 { 17 boost::SampleGraph::vertex_descriptor s, t; 18 boost::SampleGraph::Graph g; 19 boost::SampleGraph::getSampleGraph(g, s, t); 20 21 boost::successive_shortest_path_nonnegative_weights(g, s, t); 22 23 int cost = boost::find_flow_cost(g); 24 assert(cost == 29); 25 26 return 0; 27 } 28