|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface Flow
Flow.java This interface is used to implement Max Flow and matching algorithms algorithms over Graphs.
Method Summary | |
---|---|
int |
getMaxFlow(Graph g,
int s,
int t)
Finds the maximum flow in a flow network |
int |
getMaximumMatching(Graph g)
Finds the maximum matching in a Bipartite graph. |
Method Detail |
---|
int getMaxFlow(Graph g, int s, int t)
g
- the Flow network as a graph. Each edge weight indicates the capacity on that edge.s
- the source vertext
- the sink vertex
int getMaximumMatching(Graph g)
g
- an unwieghted, undirected bipartite graph, where the graph is partitioned into odd and even vertices.
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |