klao [Tue, 29 Jan 2008 03:39:05 +0000] rev 2559
grid_ugraph.h: fixed #18 (global functions inlined)
kpeter [Mon, 28 Jan 2008 11:42:46 +0000] rev 2558
Improved rename script to handle includes correctly.
alpar [Mon, 21 Jan 2008 15:35:55 +0000] rev 2557
Reveal an existing functionality in the documentation
kpeter [Sun, 13 Jan 2008 10:32:14 +0000] rev 2556
Cleanup in the minimum cost flow files.
The changes only affects the documentation and the look of the source codes.
kpeter [Sun, 13 Jan 2008 10:26:55 +0000] rev 2555
Reimplemented MinMeanCycle to be much more efficient.
The new version implements Howard's algorithm instead of Karp's algorithm and
it is at least 10-20 times faster on all the 40-50 random graphs we have tested.
alpar [Mon, 07 Jan 2008 17:07:40 +0000] rev 2554
Minor doc fix
alpar [Mon, 07 Jan 2008 13:09:48 +0000] rev 2553
Happy New Year to LEMON (+ better update-copyright-header script)
kpeter [Fri, 04 Jan 2008 00:47:08 +0000] rev 2552
Improved rename script to avoid "undirected digraph".
ladanyi [Mon, 31 Dec 2007 19:21:21 +0000] rev 2551
Include functional because of std::less.
deba [Sun, 30 Dec 2007 18:23:32 +0000] rev 2550
Changing degree of tournament tree
Bug fix in union find
Small efficiency improvment in bipartite matchings
deba [Sat, 29 Dec 2007 15:11:41 +0000] rev 2549
Test program for max weighted matchings
deba [Fri, 28 Dec 2007 11:00:51 +0000] rev 2548
Edmond's Blossom shrinking algroithm:
MaxWeightedMatching
MaxWeightedPerfectMatching
deba [Thu, 27 Dec 2007 13:40:16 +0000] rev 2547
Renaming state_enum to State
Removing "Type" suffix from typedefs
Moving implementation into the class definition
deba [Thu, 20 Dec 2007 15:21:22 +0000] rev 2546
Bug fix in erase
deba [Thu, 20 Dec 2007 15:13:06 +0000] rev 2545
Casting index to int
kpeter [Wed, 19 Dec 2007 22:23:28 +0000] rev 2544
Bug fix (Circulation interface changed).
alpar [Wed, 19 Dec 2007 09:16:22 +0000] rev 2543
Change the local variables lower case
deba [Mon, 17 Dec 2007 09:54:26 +0000] rev 2542
Bug fix
deba [Wed, 12 Dec 2007 13:35:55 +0000] rev 2541
Bug fix
deba [Tue, 11 Dec 2007 17:42:49 +0000] rev 2540
Avoiding warnings
deba [Tue, 11 Dec 2007 17:37:08 +0000] rev 2539
DynEdgeLookUp implementation based on splay trees
In general case it is slower than the static version, but it should not
refreshed on the change of the graph
deba [Mon, 10 Dec 2007 16:34:31 +0000] rev 2538
Bug fix in doc
deba [Mon, 10 Dec 2007 16:33:37 +0000] rev 2537
Using operation traits in dijkstra
kpeter [Fri, 07 Dec 2007 12:00:32 +0000] rev 2536
Modified rename script (BpGraph instead of Bigraph).
kpeter [Wed, 05 Dec 2007 13:03:19 +0000] rev 2535
Redesigned CapacityScaling algorithm with almost the same interface.
The new version does not use the ResidualGraphAdaptor for performance reasons.
Scaling can be enabled and disabled with a parameter of the run() function.
kpeter [Wed, 05 Dec 2007 12:57:24 +0000] rev 2534
Improved docs.
kpeter [Wed, 05 Dec 2007 01:43:02 +0000] rev 2533
Bug fixes.
kpeter [Tue, 04 Dec 2007 18:51:35 +0000] rev 2532
Bug fixes in the rename script.
deba [Tue, 04 Dec 2007 14:08:27 +0000] rev 2531
rename graphs script
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
deba [Fri, 30 Nov 2007 09:22:38 +0000] rev 2529
Minor changes
deba [Wed, 28 Nov 2007 18:05:49 +0000] rev 2528
Gomory-Hu tree algorithm
deba [Wed, 28 Nov 2007 18:01:38 +0000] rev 2527
bug fix
class without constructor error
deba [Wed, 28 Nov 2007 17:51:02 +0000] rev 2526
Redesign Circulation interface according to new flow interface
New greedy approach initialization
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
deba [Wed, 28 Nov 2007 16:42:58 +0000] rev 2524
Bug fix resetting activeness of node at initialization
ladanyi [Tue, 27 Nov 2007 16:26:58 +0000] rev 2523
Fix warning when compiling with -Wall.
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
deba [Sun, 25 Nov 2007 22:56:44 +0000] rev 2521
Bugfix: using read-write map instead reference map
deba [Wed, 21 Nov 2007 18:19:20 +0000] rev 2520
Better solution
deba [Wed, 21 Nov 2007 13:35:10 +0000] rev 2519
Changed queue implementation
deba [Wed, 21 Nov 2007 13:34:38 +0000] rev 2518
Bugfix in min cut computation
kpeter [Tue, 20 Nov 2007 21:40:55 +0000] rev 2517
Small changes in the documentation.
deba [Tue, 20 Nov 2007 15:06:03 +0000] rev 2516
Nauty graph6 reader
deba [Sat, 17 Nov 2007 21:41:01 +0000] rev 2515
Changing max flow interface
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)
deba [Wed, 14 Nov 2007 17:53:08 +0000] rev 2513
Query the result value of an expression
deba [Wed, 14 Nov 2007 17:44:42 +0000] rev 2512
Elevator: slight changes in elevator interface
LinkedElevator: based on linked lists
deba [Wed, 14 Nov 2007 17:42:48 +0000] rev 2511
IntegerMap
deba [Wed, 14 Nov 2007 15:36:37 +0000] rev 2510
removing semicolon ftom the end of GRAPH_TYPEDEFS
kpeter [Wed, 14 Nov 2007 06:28:08 +0000] rev 2509
Small changes in the min. cost flow classes.
deba [Thu, 08 Nov 2007 14:21:28 +0000] rev 2508
Planar graph coloring
kpeter [Wed, 07 Nov 2007 21:52:57 +0000] rev 2507
Small bug fix.
deba [Tue, 30 Oct 2007 20:44:53 +0000] rev 2506
Change to new union-find interface
deba [Tue, 30 Oct 2007 20:21:10 +0000] rev 2505
Redesign interface of MaxMatching and UnionFindEnum
New class ExtendFindEnum
Faster MaxMatching
deba [Tue, 30 Oct 2007 10:51:07 +0000] rev 2504
Bug fix
alpar [Thu, 25 Oct 2007 16:57:43 +0000] rev 2503
Fix a typo that caused the failure of 'make dist'
deba [Wed, 24 Oct 2007 16:31:49 +0000] rev 2502
BpUGraphReader and Writer
deba [Sat, 20 Oct 2007 14:29:12 +0000] rev 2501
Forgotten images
deba [Fri, 19 Oct 2007 17:07:50 +0000] rev 2500
planar doxygen group
deba [Fri, 19 Oct 2007 16:24:31 +0000] rev 2499
Planar Grid Embedding
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)
ladanyi [Fri, 19 Oct 2007 13:50:13 +0000] rev 2497
Build fix.
deba [Wed, 17 Oct 2007 12:46:14 +0000] rev 2496
setAll for iterable bool maps
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.
ladanyi [Fri, 12 Oct 2007 22:19:03 +0000] rev 2494
Makefile fix.
deba [Tue, 09 Oct 2007 17:46:06 +0000] rev 2493
Bad documentation
deba [Tue, 09 Oct 2007 17:13:17 +0000] rev 2492
Adding doc
deba [Tue, 09 Oct 2007 17:11:42 +0000] rev 2491
Documentation for lemon tools
deba [Tue, 09 Oct 2007 16:22:04 +0000] rev 2490
Minor bug fixes in documentation
deba [Tue, 09 Oct 2007 15:46:12 +0000] rev 2489
Bug fix and redesign StdMap
Improving map adaptors documentations
deba [Tue, 09 Oct 2007 09:36:54 +0000] rev 2488
Bug fix in MaxMatching
deba [Tue, 02 Oct 2007 14:20:04 +0000] rev 2487
Removing other occurences of cnt
deba [Tue, 02 Oct 2007 14:15:18 +0000] rev 2486
Doc bug fix
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!
alpar [Mon, 01 Oct 2007 19:23:16 +0000] rev 2484
make it compatible with current version of glpk
alpar [Mon, 01 Oct 2007 18:57:21 +0000] rev 2483
- Gamma distributon random variable.
- Test file for random.h
alpar [Mon, 01 Oct 2007 18:55:58 +0000] rev 2482
Missing header file added.
deba [Sun, 30 Sep 2007 19:19:33 +0000] rev 2481
Avoiding warnings
deba [Sun, 30 Sep 2007 19:14:33 +0000] rev 2480
Planarity checking and embedding
deba [Fri, 28 Sep 2007 12:42:14 +0000] rev 2479
Once again bug fix in significant bit calculation
deba [Fri, 28 Sep 2007 12:15:10 +0000] rev 2478
The same for unsigned radix sort
deba [Fri, 28 Sep 2007 12:14:18 +0000] rev 2477
Bug fix in most significant digit calculation
kpeter [Thu, 27 Sep 2007 13:04:06 +0000] rev 2476
Bug fixes in the documentation (mainly bad references).
deba [Wed, 26 Sep 2007 14:37:48 +0000] rev 2475
Generate tools documentation
kpeter [Wed, 19 Sep 2007 23:35:27 +0000] rev 2474
Small bug fixes and changes in the documentation.
kpeter [Sun, 16 Sep 2007 14:21:12 +0000] rev 2473
Small improvement in documentation.
kpeter [Sun, 16 Sep 2007 13:29:42 +0000] rev 2472
Missing header.
kpeter [Thu, 13 Sep 2007 22:06:54 +0000] rev 2471
Small changes in min. cost flow algorithms.
kpeter [Thu, 13 Sep 2007 22:05:32 +0000] rev 2470
Small bug fixes.
deba [Fri, 31 Aug 2007 08:40:49 +0000] rev 2469
Invalid assignments ambiguity handling
deba [Tue, 28 Aug 2007 14:13:40 +0000] rev 2468
More simple interface for PathDumper
deba [Tue, 28 Aug 2007 14:00:42 +0000] rev 2467
PathNodeIt
PathWriter/Reader structures
Distinict MapSet readers and writers
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
ladanyi [Sat, 25 Aug 2007 10:12:03 +0000] rev 2465
Consider the CPXMIP_OPTIMAL_TOL status as OPTIMAL too.
deba [Fri, 24 Aug 2007 14:32:55 +0000] rev 2464
uedgeset is an alias for edgeset