edu.stanford.math.plex4.bottleneck

Class FordFulkerson

java.lang.Object

edu.stanford.math.plex4.bottleneck.FordFulkerson

public class FordFulkerson
extends java.lang.Object

The Ford-Fulkerson Algorithm

Author:

Tim Harrington

Constructor Summary

Constructors

Constructor and Description
FordFulkerson()

Method Summary

Methods

Modifier and Type	Method and Description
int	maxFlow(FordFulkersonNode[] v, FordFulkersonEdge[] e, int snode, int tnode) Inputs a graph to compute max flow/min cut for.
protected void	rdb()
protected void	solve()
protected void	stpath()

Methods inherited from class java.lang.Object

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

Constructor Detail

FordFulkerson

public FordFulkerson()

Method Detail

maxFlow

public int maxFlow(FordFulkersonNode[] v,
          FordFulkersonEdge[] e,
          int snode,
          int tnode)

Inputs a graph to compute max flow/min cut for. The source node must be v[0] and the sink must be v[v.length-1].

Parameters:

v -

e -

solve

protected void solve()

rdb

protected void rdb()

stpath

protected void stpath()