Minimum cost flow problem

Graph.read_mincost(int vertex_data_size, int arc_data_size, int v_rhs, int a_low, int a_cap, int a_cost, str fname)

Read min-cost flow problem data in DIMACS format

Graph.write_mincost(int v_rhs, int a_low, int a_cap, int a_cost, fname)

Write min-cost flow problem data in DIMACS format

Graph.mincost_lp(bool copy_names, int v_rhs, int a_low, int a_cap, int a_cost)

Convert minimum cost flow problem to LP

Graph.mincost_okalg(int v_rhs, int a_low, int a_cap, int a_cost, int a_x, int v_pi)

Find minimum-cost flow with out-of-kilter algorithm

Graph.mincost_relax4(int v_rhs, int a_low, int a_cap, int a_cost, int crash, int a_x, int a_rc)

Find minimum-cost flow with Bertsekas-Tseng relaxation method

Graph.netgen(int vertex_data_size, int arc_data_size, int v_rhs, int a_cap, int a_cost, **parameters)

Klingman’s network problem generator

Graph.gridgen(int vertex_data_size, int arc_data_size, int v_rhs, int a_cap, int a_cost, **parameters)

Grid-like network problem generator