Flows

Ford-Fulkerson

max_flow(G, s, t[, capacity])	Find the value of a maximum single-commodity flow.
min_cut(G, s, t[, capacity])	Compute the value of a minimum (s, t)-cut.
ford_fulkerson(G, s, t[, capacity])	Find a maximum single-commodity flow using the Ford-Fulkerson algorithm.
ford_fulkerson_flow(G, s, t[, capacity])	Return a maximum flow for a single-commodity flow problem.

Network Simplex

network_simplex(G[, demand, capacity, weight])	Find a minimum cost flow satisfying all demands in digraph G.
min_cost_flow_cost(G[, demand, capacity, weight])	Find the cost of a minimum cost flow satisfying all demands in digraph G.
min_cost_flow(G[, demand, capacity, weight])	Return a minimum cost flow satisfying all demands in digraph G.
cost_of_flow(G, flowDict[, weight])	Compute the cost of the flow given by flowDict on graph G.
max_flow_min_cost(G, s, t[, capacity, weight])	Return a maximum (s, t)-flow of minimum cost.