Maximum flow algorithm

Topics: algorithm, graph
Nov 30, 2012 at 7:12 PM

Hello,

I am quite new to Quick Graph. In the documentation, I have found the code example for EdmonKarpMaximumFlow algorithm. But it computes only the flow. How can I actually get the flow path (the edges in the path)? Is it possible?

Jan 11, 2013 at 1:38 AM

The object contains properties

Capacties

and

ResidualCapacities

That compute the two. If you're looking at the documentation, you also want to look at its superclass

MaximumFlowAlgorithm

A small annoyance - Capacities is a function but ResidualCapacities is a Dictionary.