Function
fordFulkersonAlgorithm
Computes a maximum flow in a directed graph.
fordFulkersonAlgorithm(g, source, sink, capacity, flow)
Include Headers
seqan/graph_algorithms.h
Parameters
g
In-parameter:A directed graph.
source
In-parameter:A source vertex.
sink
In-parameter:A sink vertex.
capacity
In-parameter:A property map of edge capacities.
flow
Out-parameter:A property map with the flow of each edge.
Return Values
The value of the flow.
Example Programs
SeqAn - Sequence Analysis Library - www.seqan.de
 

Page built @2013/07/11 09:12:17