mirror of
https://github.com/boostorg/graph.git
synced 2025-05-09 23:14:00 +00:00
66 lines
2.2 KiB
C++
66 lines
2.2 KiB
C++
//=======================================================================
|
|
// Copyright 2000 University of Notre Dame.
|
|
// Authors: Jeremy G. Siek, Andrew Lumsdaine, Lie-Quan Lee
|
|
//
|
|
// This file is part of the Boost Graph Library
|
|
//
|
|
// You should have received a copy of the License Agreement for the
|
|
// Boost Graph Library along with the software; see the file LICENSE.
|
|
// If not, contact Office of Research, University of Notre Dame, Notre
|
|
// Dame, IN 46556.
|
|
//
|
|
// Permission to modify the code and to distribute modified code is
|
|
// granted, provided the text of this NOTICE is retained, a notice that
|
|
// the code was modified is included with the above COPYRIGHT NOTICE and
|
|
// with the COPYRIGHT NOTICE in the LICENSE file, and that the LICENSE
|
|
// file is distributed with the modified code.
|
|
//
|
|
// LICENSOR MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED.
|
|
// By way of example, but not limitation, Licensor MAKES NO
|
|
// REPRESENTATIONS OR WARRANTIES OF MERCHANTABILITY OR FITNESS FOR ANY
|
|
// PARTICULAR PURPOSE OR THAT THE USE OF THE LICENSED SOFTWARE COMPONENTS
|
|
// OR DOCUMENTATION WILL NOT INFRINGE ANY PATENTS, COPYRIGHTS, TRADEMARKS
|
|
// OR OTHER RIGHTS.
|
|
//=======================================================================
|
|
|
|
#include <iostream>
|
|
#include <string>
|
|
#include <boost/graph/maximum_flow.hpp>
|
|
#include <boost/graph/adjacency_list.hpp>
|
|
#include <boost/graph/read_dimacs.hpp>
|
|
#include <boost/graph/graph_utility.hpp>
|
|
|
|
int
|
|
main()
|
|
{
|
|
using namespace boost;
|
|
|
|
typedef adjacency_list_traits<listS, vecS, directedS> Traits;
|
|
typedef adjacency_list<listS, vecS, directedS,
|
|
property<vertex_name_t, std::string>,
|
|
property<edge_capacity_t, long,
|
|
property<edge_residual_capacity_t, long,
|
|
property<edge_reverse_t, Traits::edge_descriptor> > >
|
|
> Graph;
|
|
|
|
Graph g;
|
|
|
|
property_map<Graph, edge_capacity_t>::type
|
|
capacity = get(edge_capacity, g);
|
|
property_map<Graph, edge_reverse_t>::type
|
|
rev = get(edge_reverse, g);
|
|
|
|
Traits::vertex_descriptor s, t;
|
|
read_dimacs_max_flow(g, capacity, rev, s, t);
|
|
|
|
print_graph(g, get(vertex_index, g));
|
|
|
|
long flow;
|
|
flow = maximum_flow(g, s, t, capacity, get(edge_residual_capacity, g),
|
|
rev, get(vertex_index, g));
|
|
|
|
std::cout << "flow: " << flow << std::endl;
|
|
|
|
return 0;
|
|
}
|