Next: Graph Operations Up: Algorithm Specifications Previous: Minimum Spanning Tree

### Network Flows and Matching

command name | ford-fulkerson
alias |
status | drawing board
input | directed graph, source, sink
output | double (the maximum flow)
attributes used | flow
| capacity
| partition (disjoint set)
attributes set | flow
| capacity
| partition (disjoint set)

command name | goldberg-tarjan
alias |
status | implemented, but not available yet
input | directed graph, source, sink
output | double (the maximum flow)
attributes used | flow
| capacity
| partition (disjoint set)
attributes set | flow
| capacity
| partition (disjoint set)

command name | bipartite-matching
alias |
status | drawing board, (but simply calls flow alg.)
input | <graph*>
output | Set<Edge*>
attributes used | flow
| capacity
| mark
attributes set | flow
| capacity
| mark (indicates matching edge)

Next: Graph Operations Up: Algorithm Specifications Previous: Minimum Spanning Tree