Maximum flow problem

Graph.read_maxflow(int vertex_data_size, int arc_data_size, int a_cap, str fname)

Read maximum flow problem data in DIMACS format

Graph.write_maxflow(source, sink, int a_cap, fname)

Write maximum flow problem data in DIMACS format

Graph.maxflow_lp(bool copy_names, source, sink, int a_cap)

Convert maximum flow problem to LP

Graph.maxflow_ffalg(source, sink, int a_cap, int a_x, int v_cut)

Find maximal flow with Ford-Fulkerson algorithm

Graph.rmfgen(int vertex_data_size, int arc_data_size, int a_cap, parameters)

Goldfarb’s maximum flow problem generator