org.graphstream.algorithm.flow

Class FordFulkersonAlgorithm

java.lang.Object

org.graphstream.algorithm.flow.FlowAlgorithmBase

org.graphstream.algorithm.flow.FordFulkersonAlgorithm

All Implemented Interfaces:

Algorithm, FlowAlgorithm

Direct Known Subclasses:

EdmondsKarpAlgorithm

public class FordFulkersonAlgorithm
extends FlowAlgorithmBase

The Ford-Fulkerson algorithm to compute maximum flow.

Computational Complexity :

O(Ef), where E is the number of edges in the graph and f is the maximum flow in the graph

Scientific Reference :

Ford, L. R.; Fulkerson, D. R. (1956). "Maximal flow through a network". Canadian Journal of Mathematics 8: 399–404

Constructor Summary

Constructors

Constructor and Description
FordFulkersonAlgorithm()

Method Summary

Methods

Modifier and Type	Method and Description
void	compute() Run the algorithm.

Methods inherited from class org.graphstream.algorithm.flow.FlowAlgorithmBase

getCapacity, getCapacity, getCapacity, getCapacityAttribute, getFlow, getFlow, getFlow, getFlowSinkId, getFlowSourceId, getMaximumFlow, init, init, setAllCapacities, setCapacity, setCapacity, setCapacity, setCapacityAttribute, setFlow, setFlow, setFlow

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

FordFulkersonAlgorithm

public FordFulkersonAlgorithm()

Method Detail

compute

public void compute()

Description copied from interface: Algorithm

Run the algorithm. The Algorithm.init(Graph) method has to be called before computing.

See Also:

Algorithm.init(Graph)