mirror of
https://github.com/boostorg/graph.git
synced 2025-05-11 13:24:01 +00:00
69 lines
2.9 KiB
C++
69 lines
2.9 KiB
C++
//=======================================================================
|
|
// Copyright 2001 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, Indiana University,
|
|
// Bloomington, IN 47405.
|
|
//
|
|
// Permission to modify the code and to distribute the code is
|
|
// granted, provided the text of this NOTICE is retained, a notice if
|
|
// 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/push_relabel_max_flow.hpp>
|
|
#include <boost/graph/adjacency_list.hpp>
|
|
#include <boost/graph/read_dimacs.hpp>
|
|
int
|
|
main()
|
|
{
|
|
using namespace boost;
|
|
typedef adjacency_list_traits < vecS, vecS, directedS > Traits;
|
|
typedef adjacency_list < vecS, 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_residual_capacity_t >::type
|
|
residual_capacity = get(edge_residual_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);
|
|
|
|
#ifdef BOOST_MSVC
|
|
property_map<Graph, vertex_index_t>::type indexmap = get(vertex_index, g);
|
|
long flow = push_relabel_max_flow(g, s, t, capacity, residual_capacity, rev,
|
|
indexmap);
|
|
#else
|
|
long flow = push_relabel_max_flow(g, s, t);
|
|
#endif
|
|
|
|
std::cout << "c The total flow:" << std::endl;
|
|
std::cout << "s " << flow << std::endl << std::endl;
|
|
std::cout << "c flow values:" << std::endl;
|
|
graph_traits < Graph >::vertex_iterator u_iter, u_end;
|
|
graph_traits < Graph >::out_edge_iterator ei, e_end;
|
|
for (tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter)
|
|
for (tie(ei, e_end) = out_edges(*u_iter, g); ei != e_end; ++ei)
|
|
if (capacity[*ei] > 0)
|
|
std::cout << "f " << *u_iter << " " << target(*ei, g) << " "
|
|
<< (capacity[*ei] - residual_capacity[*ei]) << std::endl;
|
|
return EXIT_SUCCESS;
|
|
}
|