honours/impl, branch master

A test I forgot to commit earlier.

2012-11-29T05:39:52Z

Thesis and performance testing related stuff.

2012-11-27T07:20:06Z

Updated solver stuff. This really should have already been in here...

2012-11-27T03:56:56Z

A few fixes.

2012-11-22T00:06:49Z

Some performance stuff for the solver

2012-11-21T08:57:07Z

Bug fixes for stupid things.

2012-11-20T15:10:41Z

Implementation stuff.

2012-11-20T14:43:43Z

A bunch of changes to make it build nicer

2012-11-09T05:39:12Z

In particular: - fix up the MCF sovler to get rid of all the warnings/errors - make the build with Wall and Werror and whatnot again

Add an MCF operator to the separate solver

2012-11-09T01:17:46Z

For the solver utility it'd be good to have MCF problems, so here they are! Format is: MCF(cost*) Supplies is a [int,int,int,...], where each int represents a new node Arcs is [int:int, int:int, int:int, ...] where each int:int pair represents an edge from the first to the second (1 indexed from the "supplies" array). Costs is the argument to the function. There must be as many costs as arcs, and they are set from left to right, in order.

Remove a bit of junk and fix up the logging again.

2012-11-05T07:14:23Z