Thu, 10 Feb 2005 18:53:30 +0000 marci trying to add constraints of kind 1 <= x[2]+x[3] <= 4
Tue, 08 Feb 2005 17:47:19 +0000 marci The pair of setSomeThing function is getSomeThing.
Tue, 08 Feb 2005 11:27:03 +0000 ladanyi more docs
Mon, 07 Feb 2005 17:35:25 +0000 hegyi This is not ready yet, but I have to go home...
Mon, 07 Feb 2005 15:40:53 +0000 deba Removing from work.
Mon, 07 Feb 2005 15:40:34 +0000 deba Changing first to iterators.
Mon, 07 Feb 2005 12:31:30 +0000 alpar Fix wrong reference in the documentation.
Mon, 07 Feb 2005 11:29:25 +0000 deba IO moved to lemon.
Mon, 07 Feb 2005 11:28:37 +0000 deba Graph documentation
Mon, 07 Feb 2005 10:50:05 +0000 deba Removing graph_defines.h
Mon, 07 Feb 2005 10:49:44 +0000 deba Documentation
Mon, 07 Feb 2005 10:48:14 +0000 deba Documentation
Sun, 06 Feb 2005 20:14:30 +0000 alpar Revised dijkstra.h with several new features added.
Sun, 06 Feb 2005 20:08:25 +0000 alpar The new dijkstra.h comes in the next commit.
Sun, 06 Feb 2005 20:00:56 +0000 alpar - PredNodeMap is a NullMap by default
Sun, 06 Feb 2005 15:49:37 +0000 alpar error.h added
Sun, 06 Feb 2005 14:44:41 +0000 alpar Several important changes:
Sun, 06 Feb 2005 14:38:00 +0000 alpar Document state_enum
Sat, 05 Feb 2005 20:17:15 +0000 alpar Oops.
Sat, 05 Feb 2005 20:05:01 +0000 alpar A new exception class called UninitializedParameter.
Sat, 05 Feb 2005 13:40:01 +0000 hegyi Dijkstra documentation is getting ready, but one decision is missing about naming conventions about named_params
Fri, 04 Feb 2005 15:32:11 +0000 hegyi Documentation is developing itself, but is not ready yet.
Thu, 03 Feb 2005 19:31:37 +0000 klao New error.h moved to lemon/
Thu, 03 Feb 2005 19:27:10 +0000 klao Obsolete error.h removed
Thu, 03 Feb 2005 19:24:42 +0000 klao Latest LEMON exception and assert concepts
Thu, 03 Feb 2005 16:08:56 +0000 alpar Two incomplete additions:
Wed, 02 Feb 2005 16:23:41 +0000 alpar Minor changes.
Wed, 02 Feb 2005 13:11:54 +0000 alpar Bugfix
Wed, 02 Feb 2005 11:54:55 +0000 alpar - More or less follows the new naming convetions
Tue, 01 Feb 2005 15:56:37 +0000 deba Some changes in the IO and map utilities.
Tue, 01 Feb 2005 15:51:22 +0000 deba Tutorial for graph input - output
Tue, 01 Feb 2005 15:43:14 +0000 marci correction
Tue, 01 Feb 2005 15:26:47 +0000 marci try of grouping for documentation
Tue, 01 Feb 2005 12:53:30 +0000 marci lower and upper bound handling functions for rows
Mon, 31 Jan 2005 17:00:12 +0000 marci new functions for changing lower and upper bounds of variables
Sat, 29 Jan 2005 23:22:56 +0000 alpar - Fix missing file (max_matching.h)
Sat, 29 Jan 2005 23:22:02 +0000 alpar - '%%Title:', '%%Copyright:' and '%%CreationDate:' fields added to graphToEps-
Sat, 29 Jan 2005 15:09:41 +0000 alpar - Node shapes are shown in the doc.
Fri, 28 Jan 2005 15:37:08 +0000 deba Concept modification to resolve the item by its ID.
Fri, 28 Jan 2005 15:19:34 +0000 alpar One more trial/approach for named params (Under constr.)
Fri, 28 Jan 2005 14:33:32 +0000 marci small changes, a try for max flow using expression
Fri, 28 Jan 2005 09:09:59 +0000 alpar Add a 'scaleToA4()' function.
Fri, 28 Jan 2005 09:04:34 +0000 alpar Functions to query height/width of a BoundingBox.
Fri, 28 Jan 2005 08:53:48 +0000 alpar Wrap a long line
Thu, 27 Jan 2005 18:13:58 +0000 alpar - Some things to do.
Thu, 27 Jan 2005 17:44:04 +0000 marci -=, - operators in expressions
Thu, 27 Jan 2005 16:11:54 +0000 jacint (none)
Wed, 26 Jan 2005 15:54:06 +0000 marci A proposal or test implementation for linear expression`
Wed, 26 Jan 2005 09:00:40 +0000 ladanyi Various changes.
Wed, 26 Jan 2005 00:09:06 +0000 ladanyi Removed some unnecessary files.
Tue, 25 Jan 2005 18:37:31 +0000 jacint (none)
Tue, 25 Jan 2005 17:40:22 +0000 jacint Adding a function which returns the mate of a node.
Tue, 25 Jan 2005 17:39:24 +0000 jacint following the changes of max_matching.h
Thu, 20 Jan 2005 14:16:40 +0000 alpar Now, the actual drawing is made by run() instead of the destructor.
Thu, 20 Jan 2005 10:24:38 +0000 jacint resetPos deleted
Wed, 19 Jan 2005 20:19:31 +0000 alpar - Nodes are drawn in a better way