#include <boost/config.hpp>
#include <vector>
#include <algorithm>
#include <boost/pending/queue.hpp>
#include <boost/property_map/property_map.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/properties.hpp>
#include <boost/graph/filtered_graph.hpp>
#include <boost/graph/breadth_first_search.hpp>
Namespaces | |
boost | |
Duration formatting facet for input. | |
boost::detail | |
Functions | |
template<class Graph , class ResCapMap > | |
filtered_graph< Graph, is_residual_edge< ResCapMap > > | boost::detail::residual_graph (Graph &g, ResCapMap residual_capacity) |
template<class Graph , class PredEdgeMap , class ResCapMap , class RevEdgeMap > | |
void | boost::detail::augment (Graph &g, typename graph_traits< Graph >::vertex_descriptor src, typename graph_traits< Graph >::vertex_descriptor sink, PredEdgeMap p, ResCapMap residual_capacity, RevEdgeMap reverse_edge) |
template<class Graph , class CapacityEdgeMap , class ResidualCapacityEdgeMap , class ReverseEdgeMap , class ColorMap , class PredEdgeMap > | |
property_traits < CapacityEdgeMap > ::value_type | boost::edmonds_karp_max_flow (Graph &g, typename graph_traits< Graph >::vertex_descriptor src, typename graph_traits< Graph >::vertex_descriptor sink, CapacityEdgeMap cap, ResidualCapacityEdgeMap res, ReverseEdgeMap rev, ColorMap color, PredEdgeMap pred) |
template<class Graph , class P , class T , class R > | |
detail::edge_capacity_value < Graph, P, T, R >::type | boost::edmonds_karp_max_flow (Graph &g, typename graph_traits< Graph >::vertex_descriptor src, typename graph_traits< Graph >::vertex_descriptor sink, const bgl_named_params< P, T, R > ¶ms) |
template<class Graph > | |
property_traits< typename property_map< Graph, edge_capacity_t >::const_type > ::value_type | boost::edmonds_karp_max_flow (Graph &g, typename graph_traits< Graph >::vertex_descriptor src, typename graph_traits< Graph >::vertex_descriptor sink) |