alpar [Mon, 12 Feb 2007 17:54:36 +0000] rev 2360
Lagrange relaxation based algorithm for the delay constrained least cost
path problem.
deba [Mon, 12 Feb 2007 10:27:03 +0000] rev 2359
Some spellcheck
deba [Mon, 12 Feb 2007 10:25:56 +0000] rev 2358
Dijkstra could return the temporarly distance of the current node
deba [Sun, 11 Feb 2007 16:34:51 +0000] rev 2357
Some bug fix
RevIt => RevEdgeIt renaming
alpar [Wed, 07 Feb 2007 18:07:10 +0000] rev 2356
Further doc improvements
alpar [Tue, 06 Feb 2007 19:16:26 +0000] rev 2355
Two new distributions added:
- Gaussian distribution generated using the polar form of the Box-Muller
transformation,
- Exponential distribution generated using inverse cdf.
alpar [Tue, 06 Feb 2007 19:09:17 +0000] rev 2354
Doc improvements
alpar [Thu, 25 Jan 2007 14:38:55 +0000] rev 2353
A push/relabel type max cardinality matching implementation.
(slightly incompatible with bipartite_matching.h)
alpar [Thu, 25 Jan 2007 14:36:21 +0000] rev 2352
Doc improvements
deba [Tue, 23 Jan 2007 13:13:39 +0000] rev 2351
Correction of the wrong base class