honours - My honours project from 2012.

Age	Commit message (Expand)	Author
2012-11-09	Add an MCF operator to the separate solver...For the solver utility it'd be good to have MCF problems, so here they are! Format is: MCF<supplies, arcs>(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.	Carlo Zancanaro
2012-10-15	Some bug fixes for the solver....Still doesn't work in clang, though.	Carlo Zancanaro
2012-09-05	Delete a lot of tex stuff, better debug info...Some other stuff, too, I think. Oh well. No biggie!	Carlo Zancanaro
2012-07-10	A few other changes that were needed for tests...I must have forgotten to commit them earlier. How annoying.	Carlo Zancanaro
2012-05-28	Fix memory error and x = max(-inf, expr) stuff.	Carlo Zancanaro
2012-05-17	Fix a segfault and a stupid parser decision.	Carlo Zancanaro
2012-05-03	Add a parser for linear equations...(Also add the antlr jar and C runtime)	Carlo Zancanaro