Assignment problem

Graph.read_asnprob(int vertex_data_size, int arc_data_size, int v_set, int a_cost, str fname)

Read assignment problem data in DIMACS format

Graph.write_asnprob(int v_set, int a_cost, fname)

Write assignment problem data in DIMACS format

Graph.check_asnprob(int v_set)

Check correctness of assignment problem data

Graph.asnprob_lp(str asnform, bool copy_names, int v_set, int a_cost)

Convert assignment problem to LP

Graph.asnprob_okalg(str asnform, int v_set, int a_cost, int a_x)

Solve assignment problem with out-of-kilter algorithm

Graph.asnprob_hall(int v_set, int a_x)

Find bipartite matching of maximum cardinality