nxpp::MinCostMaxFlowResult< NodeID > Struct Template Reference

Result of a min-cost max-flow computation. More...

#include <flow.hpp>

Collaboration diagram for nxpp::MinCostMaxFlowResult< NodeID >:

Public Attributes
long	flow = 0
long	cost = 0
std::map< std::pair< NodeID, NodeID >, long >	edge_flows
std::map< std::size_t, long >	edge_flows_by_id

Detailed Description

template<typename NodeID>
struct nxpp::MinCostMaxFlowResult< NodeID >

Result of a min-cost max-flow computation.

The total pushed flow and total cost are reported alongside both an endpoint-keyed convenience view and a precise edge-ID keyed flow view. In multigraphs, prefer edge_flows_by_id whenever one concrete parallel edge matters.

Example:

nxpp::DiGraph g;
g.add_edge("s", "a", 2.0, {{"capacity", 3L}});
g.add_edge("a", "t", 1.0, {{"capacity", 3L}});
 
auto result = g.max_flow_min_cost("s", "t");
auto total_flow = result.flow;
auto total_cost = result.cost;

---

The documentation for this struct was generated from the following file:

• include/nxpp/flow.hpp