Custom Query (545 matches)

The attached code fails on the attached input file. It runs Preflow for all node pairs, but for one of them, it gets in an infinite loop. Using LinkedElevator, however, it works correctly, see the commented lines.

It seems that calling the deactivate() function of Elevator does not deactive the node, so it will be selected again as the highest active node.

The nodes that are reached by DFS are wrong and depend on the order source nodes are added. The attached code implements a simple graph n0-->n3, n1-->n2 and adds n0 and n1 to the source nodes of DFS. Depending on the order either n2 or n3 is not reached.

output

add node 1 add node 0 node 3: reached node 2: NOT reached node 1: reached node 0: reached

add node 0 add node 1 node 3: NOT reached node 2: reached node 1: reached node 0: reached

As many people would test LEMON on DIMACS files on the first place, it would be nice to ship a small command line tool which could do this out-of-box.

It should simply read a DIMACS file, run the corresponding algorithm and (optionally) write the output into a file. It would also be nice if it reported the running time and the value/cost of the found solution.

See also #227.