Tue, 04 Jul 2006 10:06:24 +0000Copied the autotools files from trunk and commented them out so that configure and make succeeds. lemon-1.0
ladanyi [Tue, 04 Jul 2006 10:06:24 +0000] rev 2647
Copied the autotools files from trunk and commented them out so that configure and make succeeds.

Wed, 28 Jun 2006 06:48:35 +0000Minor updates lemon-1.0
alpar [Wed, 28 Jun 2006 06:48:35 +0000] rev 2646
Minor updates

Tue, 27 Jun 2006 11:33:05 +0000Some updates based on the last meeting lemon-1.0
alpar [Tue, 27 Jun 2006 11:33:05 +0000] rev 2645
Some updates based on the last meeting

Tue, 27 Jun 2006 11:31:07 +0000Ah, I see... lemon-1.0
alpar [Tue, 27 Jun 2006 11:31:07 +0000] rev 2644
Ah, I see...

Mon, 19 Jun 2006 13:49:17 +0000without log lemon-1.0
deba [Mon, 19 Jun 2006 13:49:17 +0000] rev 2643
without log

Tue, 13 Jun 2006 18:10:15 +0000Some updates on the todo list. lemon-1.0
alpar [Tue, 13 Jun 2006 18:10:15 +0000] rev 2642
Some updates on the todo list.

Tue, 13 Jun 2006 16:28:49 +0000An uncomplete todo list for releasing a stable version of lemon. lemon-1.0
alpar [Tue, 13 Jun 2006 16:28:49 +0000] rev 2641
An uncomplete todo list for releasing a stable version of lemon.
It is in emacs Org mode.

Fri, 09 Jun 2006 09:07:54 +0000Renamed the branch to lemon-1.0 in order to avoid ambiguity. lemon-1.0
alpar [Fri, 09 Jun 2006 09:07:54 +0000] rev 2640
Renamed the branch to lemon-1.0 in order to avoid ambiguity.

Tue, 06 Jun 2006 17:04:15 +0000Brach for the stable release 1.0 1.0
alpar [Tue, 06 Jun 2006 17:04:15 +0000] rev 2639
Brach for the stable release 1.0

Thu, 04 Jun 2009 01:19:06 +0000Various improvements for NS pivot rules
kpeter [Thu, 04 Jun 2009 01:19:06 +0000] rev 2638
Various improvements for NS pivot rules

Mon, 01 Jun 2009 16:53:59 +0000Remove a faulty check from lp_test.cc
kpeter [Mon, 01 Jun 2009 16:53:59 +0000] rev 2637
Remove a faulty check from lp_test.cc

Mon, 01 Jun 2009 15:37:51 +0000Add the Cancel and Tighten min cost flow algorithm
kpeter [Mon, 01 Jun 2009 15:37:51 +0000] rev 2636
Add the Cancel and Tighten min cost flow algorithm

Mon, 01 Jun 2009 15:35:27 +0000XTI data structure for NS - backport hg commit [8c3112a66878]
kpeter [Mon, 01 Jun 2009 15:35:27 +0000] rev 2635
XTI data structure for NS - backport hg commit [8c3112a66878]

Fri, 06 Feb 2009 21:52:34 +0000Rework Network Simplex
kpeter [Fri, 06 Feb 2009 21:52:34 +0000] rev 2634
Rework Network Simplex
Use simpler and faster graph implementation instead of SmartGraph

Wed, 04 Feb 2009 14:42:31 +0000Remove a faulty include from elevator.h
alpar [Wed, 04 Feb 2009 14:42:31 +0000] rev 2633
Remove a faulty include from elevator.h

Sun, 21 Dec 2008 20:13:28 +0000Backport hg commit [81d40f1c850c] (ticket #197)
deba [Sun, 21 Dec 2008 20:13:28 +0000] rev 2632
Backport hg commit [81d40f1c850c] (ticket #197)

Sat, 20 Dec 2008 22:45:48 +0000Backport hg commit [52c04a2a652c] (ticket #197)
deba [Sat, 20 Dec 2008 22:45:48 +0000] rev 2631
Backport hg commit [52c04a2a652c] (ticket #197)

Thu, 13 Nov 2008 16:17:50 +0000Various improvements in NetworkSimplex.
kpeter [Thu, 13 Nov 2008 16:17:50 +0000] rev 2630
Various improvements in NetworkSimplex.

- Faster variant of "Altering Candidate List" pivot rule using make_heap
instead of partial_sort.
- Doc improvements.
- Removing unecessary inline keywords.

Thu, 13 Nov 2008 15:29:04 +0000Improved constructors for min cost flow classes
kpeter [Thu, 13 Nov 2008 15:29:04 +0000] rev 2629
Improved constructors for min cost flow classes
Removing the non-zero lower bounds is faster

Thu, 13 Nov 2008 10:54:42 +0000Improve tree update procedure in NetworkSimplex
kpeter [Thu, 13 Nov 2008 10:54:42 +0000] rev 2628
Improve tree update procedure in NetworkSimplex
The new method updates a smaller subtree (fixing a bug) and shifting the
potentials with a costant value.

Fri, 07 Nov 2008 20:15:10 +0000Backport doxygen options for version 1.5.7 from [9194a12c52e6]
kpeter [Fri, 07 Nov 2008 20:15:10 +0000] rev 2627
Backport doxygen options for version 1.5.7 from [9194a12c52e6]

Thu, 23 Oct 2008 16:49:06 +0000Adapt the doc generation to the hg repo
alpar [Thu, 23 Oct 2008 16:49:06 +0000] rev 2626
Adapt the doc generation to the hg repo

Wed, 15 Oct 2008 12:04:11 +0000Major improvement in the cost scaling algorithm
kpeter [Wed, 15 Oct 2008 12:04:11 +0000] rev 2625
Major improvement in the cost scaling algorithm

- Add a new variant that use the partial augment-relabel method.
- Use this method instead of push-relabel by default.
- Use the "Early Termination" heuristic instead of "Price Refinement".

Using the new method and heuristic the algorithm proved to be
2-2.5 times faster on all input files.

Wed, 08 Oct 2008 09:17:01 +0000Bug fixes is HaoOrlin and MinCostArborescence
deba [Wed, 08 Oct 2008 09:17:01 +0000] rev 2624
Bug fixes is HaoOrlin and MinCostArborescence

MinCostArborescence
- proper deallocation
HaoOrlin
- the target needn't to be the last in its bucket
- proper size of container (if each node starts in different buckets initially)

Mon, 06 Oct 2008 15:08:17 +0000Add missing pointer initializing in min cost flow classes
kpeter [Mon, 06 Oct 2008 15:08:17 +0000] rev 2623
Add missing pointer initializing in min cost flow classes

Sun, 05 Oct 2008 20:08:13 +0000Fix _setCoeff
deba [Sun, 05 Oct 2008 20:08:13 +0000] rev 2622
Fix _setCoeff

Sun, 05 Oct 2008 13:46:07 +0000Bug fix in min_cost_flow_test.cc
kpeter [Sun, 05 Oct 2008 13:46:07 +0000] rev 2621
Bug fix in min_cost_flow_test.cc

Sun, 05 Oct 2008 13:37:17 +0000Doc improvements
kpeter [Sun, 05 Oct 2008 13:37:17 +0000] rev 2620
Doc improvements

Sun, 05 Oct 2008 13:36:43 +0000Improve network simplex algorithm
kpeter [Sun, 05 Oct 2008 13:36:43 +0000] rev 2619
Improve network simplex algorithm

- Remove "Limited Search" and "Combined" pivot rules.
- Add a new pivot rule "Altering Candidate List".
- Make the edge selection faster in every pivot rule.
- Set the default rule to "Block Search".
- Doc improvements.

The algorithm became about 15-35 percent faster on various input files.
"Block Search" pivot rule proved to be by far the fastest on all inputs.

Fri, 19 Sep 2008 15:14:41 +0000G++-4.3 compatibility changes
deba [Fri, 19 Sep 2008 15:14:41 +0000] rev 2618
G++-4.3 compatibility changes

Tue, 22 Jul 2008 11:29:57 +0000Backport bug fix for Id handling from hg changeset [e67acd83a9ca]
deba [Tue, 22 Jul 2008 11:29:57 +0000] rev 2617
Backport bug fix for Id handling from hg changeset [e67acd83a9ca]

Tue, 22 Jul 2008 11:20:06 +0000Back port bug fix from hg changeset [0915721396dc]
deba [Tue, 22 Jul 2008 11:20:06 +0000] rev 2616
Back port bug fix from hg changeset [0915721396dc]

Wed, 02 Jul 2008 12:37:47 +0000Fix bug caused by m4 consuming pairs of square brackets (#108).
ladanyi [Wed, 02 Jul 2008 12:37:47 +0000] rev 2615
Fix bug caused by m4 consuming pairs of square brackets (#108).

Fri, 27 Jun 2008 06:37:14 +0000Update the version number
alpar [Fri, 27 Jun 2008 06:37:14 +0000] rev 2614
Update the version number

Fri, 13 Jun 2008 09:51:45 +0000Back porting hg commit 81563e019fa4
deba [Fri, 13 Jun 2008 09:51:45 +0000] rev 2613
Back porting hg commit 81563e019fa4

Tue, 10 Jun 2008 11:36:17 +0000Bug fix initialization
deba [Tue, 10 Jun 2008 11:36:17 +0000] rev 2612
Bug fix initialization
The std::numeric_limits<double>::min() means the smallest positive number,
and not the smallest number in the whole range of double.

Sun, 25 May 2008 16:35:05 +0000Fixing bug in named parameters (Back port bug fix of ticket #95)
deba [Sun, 25 May 2008 16:35:05 +0000] rev 2611
Fixing bug in named parameters (Back port bug fix of ticket #95)

Fri, 23 May 2008 10:55:41 +0000Bug fix full graph problam
deba [Fri, 23 May 2008 10:55:41 +0000] rev 2610
Bug fix full graph problam

Fri, 16 May 2008 12:28:23 +0000Fixing lp constraints (solving ticket #92)
deba [Fri, 16 May 2008 12:28:23 +0000] rev 2609
Fixing lp constraints (solving ticket #92)

Sat, 19 Apr 2008 13:04:51 +0000Avoid warning in random.h (backport of chgset 4790635473ef from lemon-1.0) lemon-0.7
alpar [Sat, 19 Apr 2008 13:04:51 +0000] rev 2608
Avoid warning in random.h (backport of chgset 4790635473ef from lemon-1.0)

Thu, 17 Apr 2008 21:46:06 +0000Remove SspMinCostFlow, since it is fully replaced by other classes.
kpeter [Thu, 17 Apr 2008 21:46:06 +0000] rev 2607
Remove SspMinCostFlow, since it is fully replaced by other classes.

Thu, 17 Apr 2008 21:28:21 +0000Revert mistaken changes in NEWS file.
kpeter [Thu, 17 Apr 2008 21:28:21 +0000] rev 2606
Revert mistaken changes in NEWS file.

Tue, 08 Apr 2008 16:01:28 +0000Bug fixes in LP solvers
deba [Tue, 08 Apr 2008 16:01:28 +0000] rev 2605
Bug fixes in LP solvers
- the copyLp is clarified
- newLp and copyLp gives back pointers
- cplex gives back empty string for variables without name
- cplex row and column retrieval
- added macro for soplex

Tue, 08 Apr 2008 15:16:16 +0000Fix Makefile.am
deba [Tue, 08 Apr 2008 15:16:16 +0000] rev 2604
Fix Makefile.am

Tue, 08 Apr 2008 14:43:44 +0000Small fixes in NEWS file
kpeter [Tue, 08 Apr 2008 14:43:44 +0000] rev 2603
Small fixes in NEWS file

Tue, 08 Apr 2008 11:39:40 +0000Rel.07 NEWS - 3. round
hegyi [Tue, 08 Apr 2008 11:39:40 +0000] rev 2602
Rel.07 NEWS - 3. round

Tue, 08 Apr 2008 11:38:17 +0000Rel.07 NEWS - 2. round
hegyi [Tue, 08 Apr 2008 11:38:17 +0000] rev 2601
Rel.07 NEWS - 2. round

Mon, 07 Apr 2008 16:28:20 +0000NEWS file updated for Release 0.7
hegyi [Mon, 07 Apr 2008 16:28:20 +0000] rev 2600
NEWS file updated for Release 0.7

Thu, 03 Apr 2008 12:06:48 +0000Serious bugfix in Random::gamma()
alpar [Thu, 03 Apr 2008 12:06:48 +0000] rev 2599
Serious bugfix in Random::gamma()
Backport from hg b6bede534255

Tue, 25 Mar 2008 16:28:06 +0000Minor bug fix
deba [Tue, 25 Mar 2008 16:28:06 +0000] rev 2598
Minor bug fix

Thu, 20 Mar 2008 16:57:12 +0000Correcting broken repo
deba [Thu, 20 Mar 2008 16:57:12 +0000] rev 2597
Correcting broken repo

Thu, 20 Mar 2008 16:25:47 +0000Back porting commit 81563e019fa4
deba [Thu, 20 Mar 2008 16:25:47 +0000] rev 2596
Back porting commit 81563e019fa4

Thu, 20 Mar 2008 11:38:01 +0000Bug fix for not connected graphs
deba [Thu, 20 Mar 2008 11:38:01 +0000] rev 2595
Bug fix for not connected graphs

Fri, 14 Mar 2008 14:50:04 +0000Executable property removed
deba [Fri, 14 Mar 2008 14:50:04 +0000] rev 2594
Executable property removed

Fri, 07 Mar 2008 00:24:23 +0000Fix static member initializations (ticket #30).
kpeter [Fri, 07 Mar 2008 00:24:23 +0000] rev 2593
Fix static member initializations (ticket #30).

Sun, 02 Mar 2008 22:55:27 +0000Revert to long long int since currently I don't know a better solution.
ladanyi [Sun, 02 Mar 2008 22:55:27 +0000] rev 2592
Revert to long long int since currently I don't know a better solution.

Sat, 01 Mar 2008 20:09:40 +0000In C++98 array size shall be an integral constant expression. Fixes
ladanyi [Sat, 01 Mar 2008 20:09:40 +0000] rev 2591
In C++98 array size shall be an integral constant expression. Fixes
ticket 12.

Sat, 01 Mar 2008 20:07:29 +0000There is no 'long long int' type in C++98 (only in C99).
ladanyi [Sat, 01 Mar 2008 20:07:29 +0000] rev 2590
There is no 'long long int' type in C++98 (only in C99).

Fri, 29 Feb 2008 16:09:29 +0000Bug fix in CapacityScaling.
kpeter [Fri, 29 Feb 2008 16:09:29 +0000] rev 2589
Bug fix in CapacityScaling.

Fri, 29 Feb 2008 15:57:52 +0000Small improvements in min cost flow files.
kpeter [Fri, 29 Feb 2008 15:57:52 +0000] rev 2588
Small improvements in min cost flow files.

Fri, 29 Feb 2008 15:55:39 +0000External flow and potential maps can be used in MinCostMaxFlow.
kpeter [Fri, 29 Feb 2008 15:55:39 +0000] rev 2587
External flow and potential maps can be used in MinCostMaxFlow.

Fri, 29 Feb 2008 15:55:13 +0000Reimplemented Suurballe class.
kpeter [Fri, 29 Feb 2008 15:55:13 +0000] rev 2586
Reimplemented Suurballe class.

- The new version is the specialized version of CapacityScaling.
- It is about 10-20 times faster than the former Suurballe algorithm
and about 20-50 percent faster than CapacityScaling.
- Doc improvements.
- The test file is also replaced.

Thu, 28 Feb 2008 16:33:40 +0000Backport of bug fix hg 2de55e4f57a7
deba [Thu, 28 Feb 2008 16:33:40 +0000] rev 2585
Backport of bug fix hg 2de55e4f57a7

Thu, 28 Feb 2008 02:58:26 +0000Test file for the min cost flow algorithms.
kpeter [Thu, 28 Feb 2008 02:58:26 +0000] rev 2584
Test file for the min cost flow algorithms.

Thu, 28 Feb 2008 02:57:36 +0000Small fixes and doc improvements in MinMeanCycle.
kpeter [Thu, 28 Feb 2008 02:57:36 +0000] rev 2583
Small fixes and doc improvements in MinMeanCycle.

Thu, 28 Feb 2008 02:55:23 +0000Avoid map copy in MinCostMaxFlow.
kpeter [Thu, 28 Feb 2008 02:55:23 +0000] rev 2582
Avoid map copy in MinCostMaxFlow.

Thu, 28 Feb 2008 02:54:27 +0000Query improvements in the min cost flow algorithms.
kpeter [Thu, 28 Feb 2008 02:54:27 +0000] rev 2581
Query improvements in the min cost flow algorithms.

- External flow and potential maps can be used.
- New query functions: flow() and potential().
- CycleCanceling also provides dual solution (node potentials).
- Doc improvements.

Wed, 27 Feb 2008 11:39:03 +0000Bug fixes
deba [Wed, 27 Feb 2008 11:39:03 +0000] rev 2580
Bug fixes

Mon, 25 Feb 2008 12:35:06 +0000Bug fixes in min cost flow files.
kpeter [Mon, 25 Feb 2008 12:35:06 +0000] rev 2579
Bug fixes in min cost flow files.
Use enum type instead of static constants in NetworkSimplex to avoid
linker errors.

Thu, 21 Feb 2008 13:06:33 +0000Put the definitions of global functions into a .cc file.
ladanyi [Thu, 21 Feb 2008 13:06:33 +0000] rev 2578
Put the definitions of global functions into a .cc file.

Mon, 18 Feb 2008 03:34:16 +0000Add a cost scaling min cost flow algorithm.
kpeter [Mon, 18 Feb 2008 03:34:16 +0000] rev 2577
Add a cost scaling min cost flow algorithm.

Add a cost scaling algorithm, which is performing generalized
push-relabel operations. It is almost as efficient as the capacity
scaling algorithm, but slower than network simplex.

Mon, 18 Feb 2008 03:32:56 +0000Improvements in MinCostFlow and MinCostMaxFlow.
kpeter [Mon, 18 Feb 2008 03:32:56 +0000] rev 2576
Improvements in MinCostFlow and MinCostMaxFlow.

Main changes:
- MinCostMaxFlow also provides dual solution.
- Change the name of private members to start with "_".
- Change the name of function parameters not to start with "_".
- Remove unnecessary documentation for private members.
- Doc improvements.

Mon, 18 Feb 2008 03:32:06 +0000Major improvements in NetworkSimplex.
kpeter [Mon, 18 Feb 2008 03:32:06 +0000] rev 2575
Major improvements in NetworkSimplex.

Main changes:
- Use -potenital[] instead of potential[] to conform to the usual
terminology.
- Use function parameter instead of #define commands to select pivot rule.
- Use much faster implementation for the candidate list pivot rule.
It is about 5-20 times faster now.
- Add a new pivot rule called "Limited Search" that is a modified
version of "Block Search". It is about 25 percent faster on rather
sparse graphs.
- By default "Limited Search" is used for sparse graphs and
"Block Search" is used otherwise. This combined method is the most
efficient on every input class.
- Change the name of private members to start with "_".
- Change the name of function parameters not to start with "_".
- Remove unnecessary documentation for private members.
- Many doc improvements.

Mon, 18 Feb 2008 03:30:53 +0000Improvements in CapacityScaling.
kpeter [Mon, 18 Feb 2008 03:30:53 +0000] rev 2574
Improvements in CapacityScaling.

Main changes:
- Use -potenital[] instead of potential[] to conform to the usual
terminology.
- Change the name of private members to start with "_".
- Change the name of function parameters not to start with "_".
- Remove unnecessary documentation for private members.
- Doc improvements.

Mon, 18 Feb 2008 03:30:12 +0000Improvements in CycleCanceling.
kpeter [Mon, 18 Feb 2008 03:30:12 +0000] rev 2573
Improvements in CycleCanceling.

Main changes:
- Use function parameter instead of #define commands to select negative
cycle detection method.
- Change the name of private members to start with "_".
- Change the name of function parameters not to start with "_".
- Remove unnecessary documentation for private members.
- Doc improvements.

Fri, 08 Feb 2008 11:58:32 +0000Fix VPATH builds.
ladanyi [Fri, 08 Feb 2008 11:58:32 +0000] rev 2572
Fix VPATH builds.

Fri, 08 Feb 2008 11:04:37 +0000Hopefully fix all compilation errors.
alpar [Fri, 08 Feb 2008 11:04:37 +0000] rev 2571
Hopefully fix all compilation errors.

Fri, 08 Feb 2008 10:42:38 +0000Fix a silly typo
alpar [Fri, 08 Feb 2008 10:42:38 +0000] rev 2570
Fix a silly typo

Fri, 08 Feb 2008 10:38:08 +0000#include<cmath> -> #include<lemon/math.h>
alpar [Fri, 08 Feb 2008 10:38:08 +0000] rev 2569
#include<cmath> -> #include<lemon/math.h>

Fri, 08 Feb 2008 10:18:55 +0000Math constants + configure bugfix backported
alpar [Fri, 08 Feb 2008 10:18:55 +0000] rev 2568
Math constants + configure bugfix backported
from hg a315a588a20d and 761622e5ed4c

Fri, 08 Feb 2008 09:56:46 +0000Update the server and the repository names to lemon.
alpar [Fri, 08 Feb 2008 09:56:46 +0000] rev 2567
Update the server and the repository names to lemon.

Fri, 08 Feb 2008 09:52:48 +0000Doc improvments backported from hg 9df0fe5e5109
alpar [Fri, 08 Feb 2008 09:52:48 +0000] rev 2566
Doc improvments backported from hg 9df0fe5e5109

Tue, 05 Feb 2008 12:45:23 +0000Bug fix in heap_test.cc.
kpeter [Tue, 05 Feb 2008 12:45:23 +0000] rev 2565
Bug fix in heap_test.cc.

Tue, 05 Feb 2008 12:41:05 +0000Several doc improvements and fixes in maps.h and concepts/maps.h.
kpeter [Tue, 05 Feb 2008 12:41:05 +0000] rev 2564
Several doc improvements and fixes in maps.h and concepts/maps.h.

Tue, 05 Feb 2008 11:24:32 +0000Small fixes in README.
kpeter [Tue, 05 Feb 2008 11:24:32 +0000] rev 2563
Small fixes in README.

Tue, 05 Feb 2008 11:23:23 +0000Improvements and fixes in dim2.h.
kpeter [Tue, 05 Feb 2008 11:23:23 +0000] rev 2562
Improvements and fixes in dim2.h.

- Several doc improvements.
- Fix BoundingBox::operator& implementation.

Tue, 05 Feb 2008 11:10:08 +0000Translate Hungarian varible names and improve messages in dim_test.cc.
kpeter [Tue, 05 Feb 2008 11:10:08 +0000] rev 2561
Translate Hungarian varible names and improve messages in dim_test.cc.

Tue, 05 Feb 2008 11:03:55 +0000Fix the rename script.
kpeter [Tue, 05 Feb 2008 11:03:55 +0000] rev 2560
Fix the rename script.

Tue, 29 Jan 2008 03:39:05 +0000grid_ugraph.h: fixed #18 (global functions inlined)
klao [Tue, 29 Jan 2008 03:39:05 +0000] rev 2559
grid_ugraph.h: fixed #18 (global functions inlined)

Mon, 28 Jan 2008 11:42:46 +0000Improved rename script to handle includes correctly.
kpeter [Mon, 28 Jan 2008 11:42:46 +0000] rev 2558
Improved rename script to handle includes correctly.

Mon, 21 Jan 2008 15:35:55 +0000Reveal an existing functionality in the documentation
alpar [Mon, 21 Jan 2008 15:35:55 +0000] rev 2557
Reveal an existing functionality in the documentation

Sun, 13 Jan 2008 10:32:14 +0000Cleanup in the minimum cost flow files.
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.

Sun, 13 Jan 2008 10:26:55 +0000Reimplemented MinMeanCycle to be much more efficient.
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.

Mon, 07 Jan 2008 17:07:40 +0000Minor doc fix
alpar [Mon, 07 Jan 2008 17:07:40 +0000] rev 2554
Minor doc fix

Mon, 07 Jan 2008 13:09:48 +0000Happy New Year to LEMON (+ better update-copyright-header script)
alpar [Mon, 07 Jan 2008 13:09:48 +0000] rev 2553
Happy New Year to LEMON (+ better update-copyright-header script)

Fri, 04 Jan 2008 00:47:08 +0000Improved rename script to avoid "undirected digraph".
kpeter [Fri, 04 Jan 2008 00:47:08 +0000] rev 2552
Improved rename script to avoid "undirected digraph".

Mon, 31 Dec 2007 19:21:21 +0000Include functional because of std::less.
ladanyi [Mon, 31 Dec 2007 19:21:21 +0000] rev 2551
Include functional because of std::less.

Sun, 30 Dec 2007 18:23:32 +0000Changing degree of tournament tree
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

Sat, 29 Dec 2007 15:11:41 +0000Test program for max weighted matchings
deba [Sat, 29 Dec 2007 15:11:41 +0000] rev 2549
Test program for max weighted matchings

Fri, 28 Dec 2007 11:00:51 +0000Edmond's Blossom shrinking algroithm:
deba [Fri, 28 Dec 2007 11:00:51 +0000] rev 2548
Edmond's Blossom shrinking algroithm:
MaxWeightedMatching
MaxWeightedPerfectMatching

Thu, 27 Dec 2007 13:40:16 +0000Renaming state_enum to State
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

Thu, 20 Dec 2007 15:21:22 +0000Bug fix in erase
deba [Thu, 20 Dec 2007 15:21:22 +0000] rev 2546
Bug fix in erase

Thu, 20 Dec 2007 15:13:06 +0000Casting index to int
deba [Thu, 20 Dec 2007 15:13:06 +0000] rev 2545
Casting index to int

Wed, 19 Dec 2007 22:23:28 +0000Bug fix (Circulation interface changed).
kpeter [Wed, 19 Dec 2007 22:23:28 +0000] rev 2544
Bug fix (Circulation interface changed).

Wed, 19 Dec 2007 09:16:22 +0000Change the local variables lower case
alpar [Wed, 19 Dec 2007 09:16:22 +0000] rev 2543
Change the local variables lower case

Mon, 17 Dec 2007 09:54:26 +0000Bug fix
deba [Mon, 17 Dec 2007 09:54:26 +0000] rev 2542
Bug fix

Wed, 12 Dec 2007 13:35:55 +0000Bug fix
deba [Wed, 12 Dec 2007 13:35:55 +0000] rev 2541
Bug fix

Tue, 11 Dec 2007 17:42:49 +0000Avoiding warnings
deba [Tue, 11 Dec 2007 17:42:49 +0000] rev 2540
Avoiding warnings

Tue, 11 Dec 2007 17:37:08 +0000DynEdgeLookUp implementation based on splay trees
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

Mon, 10 Dec 2007 16:34:31 +0000Bug fix in doc
deba [Mon, 10 Dec 2007 16:34:31 +0000] rev 2538
Bug fix in doc

Mon, 10 Dec 2007 16:33:37 +0000Using operation traits in dijkstra
deba [Mon, 10 Dec 2007 16:33:37 +0000] rev 2537
Using operation traits in dijkstra

Fri, 07 Dec 2007 12:00:32 +0000Modified rename script (BpGraph instead of Bigraph).
kpeter [Fri, 07 Dec 2007 12:00:32 +0000] rev 2536
Modified rename script (BpGraph instead of Bigraph).

Wed, 05 Dec 2007 13:03:19 +0000Redesigned CapacityScaling algorithm with almost the same interface.
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.

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

Mon, 07 May 2007 08:48:40 +0000Bug fix in Bfs class.
deba [Mon, 07 May 2007 08:48:40 +0000] rev 2438
Bug fix in Bfs class.

Patch from Peter Kovacs

Mon, 07 May 2007 08:47:38 +0000Small improvements in MinMeanCycle class.
deba [Mon, 07 May 2007 08:47:38 +0000] rev 2437
Small improvements in MinMeanCycle class.

Patch from Peter Kovacs

Tue, 24 Apr 2007 09:39:01 +0000Integer parameters also convert to double
alpar [Tue, 24 Apr 2007 09:39:01 +0000] rev 2436
Integer parameters also convert to double

Fri, 20 Apr 2007 17:26:38 +0000Fix the bug
alpar [Fri, 20 Apr 2007 17:26:38 +0000] rev 2435
Fix the bug

Fri, 20 Apr 2007 17:24:05 +0000Test the repository checking service
alpar [Fri, 20 Apr 2007 17:24:05 +0000] rev 2434
Test the repository checking service

Fri, 20 Apr 2007 16:22:03 +0000Fix the test bug
alpar [Fri, 20 Apr 2007 16:22:03 +0000] rev 2433
Fix the test bug

Fri, 20 Apr 2007 15:53:06 +0000Sorry...
ladanyi [Fri, 20 Apr 2007 15:53:06 +0000] rev 2432
Sorry...

Fri, 20 Apr 2007 15:51:54 +0000fix to compile with gcc 4.1.2
ladanyi [Fri, 20 Apr 2007 15:51:54 +0000] rev 2431
fix to compile with gcc 4.1.2

Fri, 20 Apr 2007 14:50:42 +0000Test broken repository warning
alpar [Fri, 20 Apr 2007 14:50:42 +0000] rev 2430
Test broken repository warning

Fri, 20 Apr 2007 14:49:21 +0000Renaming topology doxygen group
deba [Fri, 20 Apr 2007 14:49:21 +0000] rev 2429
Renaming topology doxygen group

Fri, 20 Apr 2007 14:47:19 +0000Doc change
deba [Fri, 20 Apr 2007 14:47:19 +0000] rev 2428
Doc change

Fri, 20 Apr 2007 14:06:08 +0000Clear for unionfinds
deba [Fri, 20 Apr 2007 14:06:08 +0000] rev 2427
Clear for unionfinds

Thu, 19 Apr 2007 15:14:34 +0000Allowing 'string' type quoting
deba [Thu, 19 Apr 2007 15:14:34 +0000] rev 2426
Allowing 'string' type quoting

Thu, 19 Apr 2007 15:12:59 +0000Helper classs for checking existence of a nested class
deba [Thu, 19 Apr 2007 15:12:59 +0000] rev 2425
Helper classs for checking existence of a nested class

Thu, 19 Apr 2007 15:11:58 +0000Redesigned Kruskal algorithm
deba [Thu, 19 Apr 2007 15:11:58 +0000] rev 2424
Redesigned Kruskal algorithm

The interface of function type implementation is not changed
Additional class type implementation