Wed, 05 Dec 2007 12:57:24 +0000Improved docs.
kpeter [Wed, 05 Dec 2007 12:57:24 +0000] rev 2534
Improved docs.

Wed, 05 Dec 2007 01:43:02 +0000Bug fixes.
kpeter [Wed, 05 Dec 2007 01:43:02 +0000] rev 2533
Bug fixes.

Tue, 04 Dec 2007 18:51:35 +0000Bug fixes in the rename script.
kpeter [Tue, 04 Dec 2007 18:51:35 +0000] rev 2532
Bug fixes in the rename script.

Tue, 04 Dec 2007 14:08:27 +0000rename graphs script
deba [Tue, 04 Dec 2007 14:08:27 +0000] rev 2531
rename graphs script

Tue, 04 Dec 2007 10:55:27 +0000Reimplementation of Hao-Orlin algorithm
deba [Tue, 04 Dec 2007 10:55:27 +0000] rev 2530
Reimplementation of Hao-Orlin algorithm
Little modifictaion in NagamochiIbaraki
More docs for minimum cut algorithms

Fri, 30 Nov 2007 09:22:38 +0000Minor changes
deba [Fri, 30 Nov 2007 09:22:38 +0000] rev 2529
Minor changes

Wed, 28 Nov 2007 18:05:49 +0000Gomory-Hu tree algorithm
deba [Wed, 28 Nov 2007 18:05:49 +0000] rev 2528
Gomory-Hu tree algorithm

Wed, 28 Nov 2007 18:01:38 +0000bug fix
deba [Wed, 28 Nov 2007 18:01:38 +0000] rev 2527
bug fix
class without constructor error

Wed, 28 Nov 2007 17:51:02 +0000Redesign Circulation interface according to new flow interface
deba [Wed, 28 Nov 2007 17:51:02 +0000] rev 2526
Redesign Circulation interface according to new flow interface
New greedy approach initialization

Wed, 28 Nov 2007 17:40:41 +0000Using linked elevator
deba [Wed, 28 Nov 2007 17:40:41 +0000] rev 2525
Using linked elevator
It is conform to the Graph concept in that sense
the graph maps should not be ReferenceMap

Wed, 28 Nov 2007 16:42:58 +0000Bug fix resetting activeness of node at initialization
deba [Wed, 28 Nov 2007 16:42:58 +0000] rev 2524
Bug fix resetting activeness of node at initialization

Tue, 27 Nov 2007 16:26:58 +0000Fix warning when compiling with -Wall.
ladanyi [Tue, 27 Nov 2007 16:26:58 +0000] rev 2523
Fix warning when compiling with -Wall.

Tue, 27 Nov 2007 15:41:43 +0000Performance bug in Preflow
deba [Tue, 27 Nov 2007 15:41:43 +0000] rev 2522
Performance bug in Preflow
The initial relabeling moved each node to the lowest level
Doc bug fix

Sun, 25 Nov 2007 22:56:44 +0000Bugfix: using read-write map instead reference map
deba [Sun, 25 Nov 2007 22:56:44 +0000] rev 2521
Bugfix: using read-write map instead reference map

Wed, 21 Nov 2007 18:19:20 +0000Better solution
deba [Wed, 21 Nov 2007 18:19:20 +0000] rev 2520
Better solution

Wed, 21 Nov 2007 13:35:10 +0000Changed queue implementation
deba [Wed, 21 Nov 2007 13:35:10 +0000] rev 2519
Changed queue implementation

Wed, 21 Nov 2007 13:34:38 +0000Bugfix in min cut computation
deba [Wed, 21 Nov 2007 13:34:38 +0000] rev 2518
Bugfix in min cut computation

Tue, 20 Nov 2007 21:40:55 +0000Small changes in the documentation.
kpeter [Tue, 20 Nov 2007 21:40:55 +0000] rev 2517
Small changes in the documentation.

Tue, 20 Nov 2007 15:06:03 +0000Nauty graph6 reader
deba [Tue, 20 Nov 2007 15:06:03 +0000] rev 2516
Nauty graph6 reader

Sat, 17 Nov 2007 21:41:01 +0000Changing max flow interface
deba [Sat, 17 Nov 2007 21:41:01 +0000] rev 2515
Changing max flow interface

Sat, 17 Nov 2007 20:58:11 +0000Redesign the maximum flow algorithms
deba [Sat, 17 Nov 2007 20:58:11 +0000] rev 2514
Redesign the maximum flow algorithms

Redesigned interface
Preflow changed to use elevator
Edmonds-Karp does not use the ResGraphAdaptor
Goldberg-Tarjan algorithm (Preflow with Dynamic Trees)
Dinitz-Sleator-Tarjan (Blocking flow with Dynamic Tree)

Wed, 14 Nov 2007 17:53:08 +0000Query the result value of an expression
deba [Wed, 14 Nov 2007 17:53:08 +0000] rev 2513
Query the result value of an expression

Wed, 14 Nov 2007 17:44:42 +0000Elevator: slight changes in elevator interface
deba [Wed, 14 Nov 2007 17:44:42 +0000] rev 2512
Elevator: slight changes in elevator interface
LinkedElevator: based on linked lists

Wed, 14 Nov 2007 17:42:48 +0000IntegerMap
deba [Wed, 14 Nov 2007 17:42:48 +0000] rev 2511
IntegerMap

Wed, 14 Nov 2007 15:36:37 +0000removing semicolon ftom the end of GRAPH_TYPEDEFS
deba [Wed, 14 Nov 2007 15:36:37 +0000] rev 2510
removing semicolon ftom the end of GRAPH_TYPEDEFS

Wed, 14 Nov 2007 06:28:08 +0000Small changes in the min. cost flow classes.
kpeter [Wed, 14 Nov 2007 06:28:08 +0000] rev 2509
Small changes in the min. cost flow classes.

Thu, 08 Nov 2007 14:21:28 +0000Planar graph coloring
deba [Thu, 08 Nov 2007 14:21:28 +0000] rev 2508
Planar graph coloring

Wed, 07 Nov 2007 21:52:57 +0000Small bug fix.
kpeter [Wed, 07 Nov 2007 21:52:57 +0000] rev 2507
Small bug fix.

Tue, 30 Oct 2007 20:44:53 +0000Change to new union-find interface
deba [Tue, 30 Oct 2007 20:44:53 +0000] rev 2506
Change to new union-find interface

Tue, 30 Oct 2007 20:21:10 +0000Redesign interface of MaxMatching and UnionFindEnum
deba [Tue, 30 Oct 2007 20:21:10 +0000] rev 2505
Redesign interface of MaxMatching and UnionFindEnum
New class ExtendFindEnum

Faster MaxMatching

Tue, 30 Oct 2007 10:51:07 +0000Bug fix
deba [Tue, 30 Oct 2007 10:51:07 +0000] rev 2504
Bug fix

Thu, 25 Oct 2007 16:57:43 +0000Fix a typo that caused the failure of 'make dist'
alpar [Thu, 25 Oct 2007 16:57:43 +0000] rev 2503
Fix a typo that caused the failure of 'make dist'

Wed, 24 Oct 2007 16:31:49 +0000BpUGraphReader and Writer
deba [Wed, 24 Oct 2007 16:31:49 +0000] rev 2502
BpUGraphReader and Writer

Sat, 20 Oct 2007 14:29:12 +0000Forgotten images
deba [Sat, 20 Oct 2007 14:29:12 +0000] rev 2501
Forgotten images

Fri, 19 Oct 2007 17:07:50 +0000planar doxygen group
deba [Fri, 19 Oct 2007 17:07:50 +0000] rev 2500
planar doxygen group

Fri, 19 Oct 2007 16:24:31 +0000Planar Grid Embedding
deba [Fri, 19 Oct 2007 16:24:31 +0000] rev 2499
Planar Grid Embedding

Fri, 19 Oct 2007 15:21:07 +0000Bug fix in undirected graphs (adding loops)
deba [Fri, 19 Oct 2007 15:21:07 +0000] rev 2498
Bug fix in undirected graphs (adding loops)
Bug fix in undirected edgesets (alteration notifying)

Redesigned undirected edgesets (like the smart or ugraph)

Fri, 19 Oct 2007 13:50:13 +0000Build fix.
ladanyi [Fri, 19 Oct 2007 13:50:13 +0000] rev 2497
Build fix.

Wed, 17 Oct 2007 12:46:14 +0000setAll for iterable bool maps
deba [Wed, 17 Oct 2007 12:46:14 +0000] rev 2496
setAll for iterable bool maps

Sat, 13 Oct 2007 08:48:07 +0000Added the function isFinite(), and replaced the calls to finite() with it.
ladanyi [Sat, 13 Oct 2007 08:48:07 +0000] rev 2495
Added the function isFinite(), and replaced the calls to finite() with it.
This was necessary because finite() is not a standard function. Neither can
we use its standard counterpart isfinite(), because it was introduced only
in C99, and therefore it is not supplied by all C++ implementations.

Fri, 12 Oct 2007 22:19:03 +0000Makefile fix.
ladanyi [Fri, 12 Oct 2007 22:19:03 +0000] rev 2494
Makefile fix.

Tue, 09 Oct 2007 17:46:06 +0000Bad documentation
deba [Tue, 09 Oct 2007 17:46:06 +0000] rev 2493
Bad documentation

Tue, 09 Oct 2007 17:13:17 +0000Adding doc
deba [Tue, 09 Oct 2007 17:13:17 +0000] rev 2492
Adding doc

Tue, 09 Oct 2007 17:11:42 +0000Documentation for lemon tools
deba [Tue, 09 Oct 2007 17:11:42 +0000] rev 2491
Documentation for lemon tools

Tue, 09 Oct 2007 16:22:04 +0000Minor bug fixes in documentation
deba [Tue, 09 Oct 2007 16:22:04 +0000] rev 2490
Minor bug fixes in documentation

Tue, 09 Oct 2007 15:46:12 +0000Bug fix and redesign StdMap
deba [Tue, 09 Oct 2007 15:46:12 +0000] rev 2489
Bug fix and redesign StdMap
Improving map adaptors documentations

Tue, 09 Oct 2007 09:36:54 +0000Bug fix in MaxMatching
deba [Tue, 09 Oct 2007 09:36:54 +0000] rev 2488
Bug fix in MaxMatching

Tue, 02 Oct 2007 14:20:04 +0000Removing other occurences of cnt
deba [Tue, 02 Oct 2007 14:20:04 +0000] rev 2487
Removing other occurences of cnt

Tue, 02 Oct 2007 14:15:18 +0000Doc bug fix
deba [Tue, 02 Oct 2007 14:15:18 +0000] rev 2486
Doc bug fix

Tue, 02 Oct 2007 12:34:43 +0000New developers page
deba [Tue, 02 Oct 2007 12:34:43 +0000] rev 2485
New developers page
The participation period should be included

Bug fix in doc related to Graph concpets

Removing some todos!

Mon, 01 Oct 2007 19:23:16 +0000make it compatible with current version of glpk
alpar [Mon, 01 Oct 2007 19:23:16 +0000] rev 2484
make it compatible with current version of glpk

Mon, 01 Oct 2007 18:57:21 +0000- Gamma distributon random variable.
alpar [Mon, 01 Oct 2007 18:57:21 +0000] rev 2483
- Gamma distributon random variable.
- Test file for random.h

Mon, 01 Oct 2007 18:55:58 +0000Missing header file added.
alpar [Mon, 01 Oct 2007 18:55:58 +0000] rev 2482
Missing header file added.

Sun, 30 Sep 2007 19:19:33 +0000Avoiding warnings
deba [Sun, 30 Sep 2007 19:19:33 +0000] rev 2481
Avoiding warnings

Sun, 30 Sep 2007 19:14:33 +0000Planarity checking and embedding
deba [Sun, 30 Sep 2007 19:14:33 +0000] rev 2480
Planarity checking and embedding

Fri, 28 Sep 2007 12:42:14 +0000Once again bug fix in significant bit calculation
deba [Fri, 28 Sep 2007 12:42:14 +0000] rev 2479
Once again bug fix in significant bit calculation

Fri, 28 Sep 2007 12:15:10 +0000The same for unsigned radix sort
deba [Fri, 28 Sep 2007 12:15:10 +0000] rev 2478
The same for unsigned radix sort

Fri, 28 Sep 2007 12:14:18 +0000Bug fix in most significant digit calculation
deba [Fri, 28 Sep 2007 12:14:18 +0000] rev 2477
Bug fix in most significant digit calculation

Thu, 27 Sep 2007 13:04:06 +0000Bug fixes in the documentation (mainly bad references).
kpeter [Thu, 27 Sep 2007 13:04:06 +0000] rev 2476
Bug fixes in the documentation (mainly bad references).

Wed, 26 Sep 2007 14:37:48 +0000Generate tools documentation
deba [Wed, 26 Sep 2007 14:37:48 +0000] rev 2475
Generate tools documentation

Wed, 19 Sep 2007 23:35:27 +0000Small bug fixes and changes in the documentation.
kpeter [Wed, 19 Sep 2007 23:35:27 +0000] rev 2474
Small bug fixes and changes in the documentation.

Sun, 16 Sep 2007 14:21:12 +0000Small improvement in documentation.
kpeter [Sun, 16 Sep 2007 14:21:12 +0000] rev 2473
Small improvement in documentation.

Sun, 16 Sep 2007 13:29:42 +0000Missing header.
kpeter [Sun, 16 Sep 2007 13:29:42 +0000] rev 2472
Missing header.

Thu, 13 Sep 2007 22:06:54 +0000Small changes in min. cost flow algorithms.
kpeter [Thu, 13 Sep 2007 22:06:54 +0000] rev 2471
Small changes in min. cost flow algorithms.

Thu, 13 Sep 2007 22:05:32 +0000Small bug fixes.
kpeter [Thu, 13 Sep 2007 22:05:32 +0000] rev 2470
Small bug fixes.

Fri, 31 Aug 2007 08:40:49 +0000Invalid assignments ambiguity handling
deba [Fri, 31 Aug 2007 08:40:49 +0000] rev 2469
Invalid assignments ambiguity handling

Tue, 28 Aug 2007 14:13:40 +0000More simple interface for PathDumper
deba [Tue, 28 Aug 2007 14:13:40 +0000] rev 2468
More simple interface for PathDumper

Tue, 28 Aug 2007 14:00:42 +0000PathNodeIt
deba [Tue, 28 Aug 2007 14:00:42 +0000] rev 2467
PathNodeIt

PathWriter/Reader structures
Distinict MapSet readers and writers

Tue, 28 Aug 2007 13:58:54 +0000Redesign of augmenting path based matching
deba [Tue, 28 Aug 2007 13:58:54 +0000] rev 2466
Redesign of augmenting path based matching
Small bug fix in the push-relabel based

Sat, 25 Aug 2007 10:12:03 +0000Consider the CPXMIP_OPTIMAL_TOL status as OPTIMAL too.
ladanyi [Sat, 25 Aug 2007 10:12:03 +0000] rev 2465
Consider the CPXMIP_OPTIMAL_TOL status as OPTIMAL too.

Fri, 24 Aug 2007 14:32:55 +0000uedgeset is an alias for edgeset
deba [Fri, 24 Aug 2007 14:32:55 +0000] rev 2464
uedgeset is an alias for edgeset

Tue, 21 Aug 2007 13:22:21 +0000Query functions: aMatching and bMatching
deba [Tue, 21 Aug 2007 13:22:21 +0000] rev 2463
Query functions: aMatching and bMatching
Modified algorithm function interfaces
ANodeMap<UEdge> matching map
BNodeMap<bool> barrier map

Consistency between augmenting path and push-relabel algorithm

Sat, 11 Aug 2007 16:34:41 +0000Common interface for bipartite matchings
deba [Sat, 11 Aug 2007 16:34:41 +0000] rev 2462
Common interface for bipartite matchings
Some useful query function for push-relabel based matching

The naming should be rethink for these classes
for example: pr-ap prefix for push-relabel and augmenting path
algorithms

Thu, 26 Jul 2007 13:59:12 +0000Reporting invalid ID
deba [Thu, 26 Jul 2007 13:59:12 +0000] rev 2461
Reporting invalid ID

Thu, 26 Jul 2007 12:18:02 +0000Correction in the line numbering method
deba [Thu, 26 Jul 2007 12:18:02 +0000] rev 2460
Correction in the line numbering method

Thu, 05 Jul 2007 16:39:42 +0000Sample input for sat-2 and sat demos
deba [Thu, 05 Jul 2007 16:39:42 +0000] rev 2459
Sample input for sat-2 and sat demos

Tue, 26 Jun 2007 14:02:08 +0000The mip column addition hack is necessary only for 4.16
deba [Tue, 26 Jun 2007 14:02:08 +0000] rev 2458
The mip column addition hack is necessary only for 4.16

Fri, 15 Jun 2007 14:36:24 +0000Improvments in min cost flow algorithms
deba [Fri, 15 Jun 2007 14:36:24 +0000] rev 2457
Improvments in min cost flow algorithms
- improved cycle cancelling

Fri, 15 Jun 2007 14:32:48 +0000Space reservation for SmartGraph
deba [Fri, 15 Jun 2007 14:32:48 +0000] rev 2456
Space reservation for SmartGraph

Doc improvments

Fri, 15 Jun 2007 14:31:14 +0000Using set() instead of assignment
deba [Fri, 15 Jun 2007 14:31:14 +0000] rev 2455
Using set() instead of assignment

Tue, 12 Jun 2007 14:34:28 +0000Spellcheck
alpar [Tue, 12 Jun 2007 14:34:28 +0000] rev 2454
Spellcheck

Thu, 07 Jun 2007 20:07:29 +0000Correction for multiple point on starting sweep line
deba [Thu, 07 Jun 2007 20:07:29 +0000] rev 2453
Correction for multiple point on starting sweep line

Tue, 05 Jun 2007 17:30:52 +0000Update the demo file of Circulation
alpar [Tue, 05 Jun 2007 17:30:52 +0000] rev 2452
Update the demo file of Circulation

Tue, 05 Jun 2007 17:29:46 +0000Two new constructors added to dim2::BoundingBox
alpar [Tue, 05 Jun 2007 17:29:46 +0000] rev 2451
Two new constructors added to dim2::BoundingBox

Tue, 05 Jun 2007 17:27:54 +0000Negate the meaning of the delta parameter
alpar [Tue, 05 Jun 2007 17:27:54 +0000] rev 2450
Negate the meaning of the delta parameter

Tue, 05 Jun 2007 17:24:35 +0000Minor improvement in Tutorial
alpar [Tue, 05 Jun 2007 17:24:35 +0000] rev 2449
Minor improvement in Tutorial

Tue, 05 Jun 2007 14:48:20 +0000Bugfix and improvement in -tsp2 algorithm
alpar [Tue, 05 Jun 2007 14:48:20 +0000] rev 2448
Bugfix and improvement in -tsp2 algorithm

Tue, 05 Jun 2007 11:49:19 +0000Delaunay triangulation
deba [Tue, 05 Jun 2007 11:49:19 +0000] rev 2447
Delaunay triangulation
Faster geometric minimum spanning tree

Tue, 05 Jun 2007 10:59:16 +0000A minimum spanning tree based TSP algorithm is added (-tsp2)
alpar [Tue, 05 Jun 2007 10:59:16 +0000] rev 2446
A minimum spanning tree based TSP algorithm is added (-tsp2)

Tue, 05 Jun 2007 10:57:26 +0000- Fix a serious bug in UEulerIt
alpar [Tue, 05 Jun 2007 10:57:26 +0000] rev 2445
- Fix a serious bug in UEulerIt
- Add a conversion to UEdge
- Make some member funtions to be 'const'

Fri, 11 May 2007 16:03:20 +0000Patch in network simplex
deba [Fri, 11 May 2007 16:03:20 +0000] rev 2444
Patch in network simplex

Patch from Peter Kovacs

Fri, 11 May 2007 16:02:53 +0000Patch for retrieving reached/processed node in dijkstra, bfs and dfs
deba [Fri, 11 May 2007 16:02:53 +0000] rev 2443
Patch for retrieving reached/processed node in dijkstra, bfs and dfs

Patch from Peter Kovacs

Thu, 10 May 2007 14:56:05 +0000Bug fix
deba [Thu, 10 May 2007 14:56:05 +0000] rev 2442
Bug fix

Mon, 07 May 2007 18:19:55 +0000Conformity to new GLPK interface
deba [Mon, 07 May 2007 18:19:55 +0000] rev 2441
Conformity to new GLPK interface
Hacking Mip without integer variables

Mon, 07 May 2007 11:42:18 +0000Various min cost flow solvers
deba [Mon, 07 May 2007 11:42:18 +0000] rev 2440
Various min cost flow solvers

Patch from Peter Kovacs

Mon, 07 May 2007 08:49:57 +0000Modified start() function in Dfs and Dijkstra classes to give back reached
deba [Mon, 07 May 2007 08:49:57 +0000] rev 2439
Modified start() function in Dfs and Dijkstra classes to give back reached
edge/node.

Patch from Peter Kovacs