Peter Kovacs <kpeter@inf.elte.hu> [Thu, 06 Aug 2009 20:28:28 +0200] rev 808
Traits class + named parameters for MinMeanCycle (#179)
- Add a Traits class defining LargeValue, Tolerance, Path types.
LargeValue is used for internal computations, it is 'long long'
if the length type is integer, otherwise it is 'double'.
- Add named template parameters for LargeValue and Path types.
- Improve numerical stability: remove divisions from the internal
computations. If the arc lengths are integers, then all used
values are integers (except for the cycleMean() query function,
of course).
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 06 Aug 2009 20:12:43 +0200] rev 807
Rework and fix the implementation of MinMeanCycle (#179)
- Fix the handling of the cycle means.
- Many implementation improvements:
- More efficient data storage for the strongly connected
components.
- Better handling of BFS queues.
- Merge consecutive BFS searches (perform two BFS searches
instead of three).
This version is about two times faster on average and an order of
magnitude faster if there are a lot of strongly connected components.
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 03 Aug 2009 14:35:38 +0200] rev 806
Simplify the interface of MinMeanCycle (#179)
Remove init() and reset(), and move their content into findMinMean().
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 03 Aug 2009 14:12:55 +0200] rev 805
Port MinMeanCycle from SVN -r3524 (#179)
with some doc improvements
Alpar Juttner <alpar@cs.elte.hu> [Thu, 05 Nov 2009 06:26:18 +0100] rev 804
Merge #184
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 10 Oct 2009 08:19:26 +0200] rev 803
Update Doxygen configuration file
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 10 Oct 2009 08:18:46 +0200] rev 802
Insert citations into the doc (#184)
- Add general citations to modules.
- Add specific citations for max flow and min cost flow algorithms.
- Add citations for the supported LP and MIP solvers.
- Extend the main page.
- Replace inproceedings entries with the journal versions.
- Add a new bibtex entry about network simplex.
- Remove unwanted entries.
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 10 Oct 2009 08:15:07 +0200] rev 801
Handle url fields in bib2dox.py (#184)
and modify the bibtex file using url fields.
Alpar Juttner <alpar@cs.elte.hu> [Mon, 12 Oct 2009 17:02:03 +0100] rev 800
Merge bugfix #322
Akos Ladanyi <ladanyi@tmit.bme.hu> [Mon, 12 Oct 2009 16:37:22 +0100] rev 799
Distribute LEMONConfig.cmake.in (#322)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 12 Oct 2009 15:37:13 +0100] rev 798
Merge bugfix in #250
Alpar Juttner <alpar@cs.elte.hu> [Mon, 05 Oct 2009 20:21:54 +0200] rev 797
Merge #317
Balazs Dezso <deba@inf.elte.hu> [Wed, 30 Sep 2009 11:17:00 +0200] rev 796
Remove unnecessary OsiCbc dependency (#317)
Alpar Juttner <alpar@cs.elte.hu> [Sun, 27 Sep 2009 09:47:20 +0200] rev 795
Fix (and improve) error message in mip_test.cc (#317)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 05 Oct 2009 09:48:57 +0200] rev 794
Add soplex support to scripts/bootstrap.sh plus...
it checks whether cbc and soplex are installed at the given prefix.
Balazs Dezso <deba@inf.elte.hu> [Sun, 04 Oct 2009 00:28:42 +0200] rev 793
Faster add row operation (#203)
One virtual function call instead of more
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 02 Oct 2009 17:03:43 +0200] rev 792
Improve bib2dox.py using \section for entiries (#184)
Alpar Juttner <alpar@cs.elte.hu> [Sat, 26 Sep 2009 10:15:49 +0200] rev 791
Integrate bib2dox.py into the build environments (#184)
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 26 Sep 2009 10:15:49 +0200] rev 790
Add bib->dox converter and initial references.bib (#184)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 30 Sep 2009 08:41:06 +0200] rev 789
Merge #311
Alpar Juttner <alpar@cs.elte.hu> [Wed, 30 Sep 2009 08:36:43 +0200] rev 788
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 29 Sep 2009 10:21:51 +0200] rev 787
Add a warning for List(Di)Graph::Snapshot (#311)
and extend tests for snapshots
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 28 Sep 2009 12:48:44 +0200] rev 786
Modify the implementation of ListDigraph::ArcIt (#311)
The new implementation is based on out-arc iteration (like
ListGraph::ArcIt) instead of in-arc iteration to make it
consistent with the documentation.
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 23 Aug 2009 11:13:21 +0200] rev 785
Much better implementation for node splitting (#311)
in ListDigraph. This solution is the same as the one that
is used in SmartDigraph. It is much faster and does not
invalidate any iterator like the former implementation.
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 23 Aug 2009 11:11:49 +0200] rev 784
Add a resize() function to HypercubeGraph (#311)
just like the similar functions in other static graph structures,
and extend the test files to check these functions.
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 23 Aug 2009 11:10:40 +0200] rev 783
Add reserve functions to ListGraph and SmartGraph (#311)
ListDigraph and SmartDigraph already have such functions.
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 23 Aug 2009 11:09:22 +0200] rev 782
Doc improvements, fixes and unifications for graphs (#311)
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 23 Aug 2009 11:07:50 +0200] rev 781
Doc improvements and unification for graph concepts (#311)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 29 Sep 2009 09:25:23 +0200] rev 780
Copyright notices added to scripts
Alpar Juttner <alpar@cs.elte.hu> [Tue, 29 Sep 2009 09:25:00 +0200] rev 779
Simple interactive bootstrap script