Peter Kovacs <kpeter@inf.elte.hu> [Sat, 09 May 2009 16:47:26 +0200] rev 661
Remove bits/base_extender.h, which is not used at all (#288)
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 11 May 2009 17:04:40 +0200] rev 660
Move list and edge sets to the graph module (#290)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 11 May 2009 15:48:37 +0100] rev 659
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 11 May 2009 16:42:42 +0200] rev 658
Change the explanation of the acronym LEMON (#289)
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 09 May 2009 16:39:59 +0200] rev 657
Change Graph::Edge -> Graph::Arc inheritance to conversion (#283)
Balazs Dezso <deba@inf.elte.hu> [Thu, 07 May 2009 10:46:49 +0200] rev 656
Change Undirector::Edge -> Undirector::Arc inheritance to conversion (#283)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 08 May 2009 16:21:06 +0100] rev 655
Fix the faulty merge of unify-sources.sh in [586b65073025]
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 08 May 2009 13:15:29 +0200] rev 654
Doc fixes for lgf-gen (#282)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 07 May 2009 12:21:00 +0100] rev 653
Merge
Alpar Juttner <alpar@cs.elte.hu> [Thu, 07 May 2009 12:19:41 +0100] rev 652
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 07 May 2009 02:07:59 +0200] rev 651
Small doc improvements (#257)
Balazs Dezso <deba@inf.elte.hu> [Thu, 07 May 2009 11:53:49 +0200] rev 650
Fix glp_prob definition (#286)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 06 May 2009 14:46:05 +0200] rev 649
Add a test file for the connectivity functions (#285)
The Euler tools have a separate test file.
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 06 May 2009 14:44:05 +0200] rev 648
Doc improvements and fixes for connectivity tools (#285)
And add loopFree(), parallelFree(), simpleGraph() to the module doc.
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 06 May 2009 14:37:44 +0200] rev 647
Bug fixes in connectivity.h (#285)
- Bug fix in tree().
- Rename simpleDigraph() to simpleGraph() (it works for both
directed and undirected graphs).
- Possibly faster implementation for parallelFree() and
simpleGraph().
Alpar Juttner <alpar@cs.elte.hu> [Wed, 29 Apr 2009 19:22:14 +0100] rev 646
Merge
Akos Ladanyi <ladanyi@tmit.bme.hu> [Wed, 29 Apr 2009 16:15:29 +0100] rev 645
Add the solver libraries to lemon.pc.in (#281)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 29 Apr 2009 17:48:41 +0100] rev 644
Merge
Alpar Juttner <alpar@cs.elte.hu> [Wed, 29 Apr 2009 17:48:18 +0100] rev 643
Resolve gcc-4.3 warning in lemon/network_simplex.h
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 29 Apr 2009 16:54:27 +0200] rev 642
Less map copying in NetworkSimplex (#234)
- The graph is copied in the constructor instead of the init() function.
It must not be modified after the class is constructed.
- The maps are copied once (instead of twice).
- Remove FlowMap, PotentialMap typedefs and flowMap(), pontentialMap()
setter functions.
- flowMap() and potentialMap() query functions copy the values into the
given map (reference) instead of returning a const reference to a
previously constructed map.
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 29 Apr 2009 14:25:51 +0200] rev 641
Rename Flow to Value in the flow algorithms (#266)
We agreed that using Flow for the value type is misleading, since
a flow should be rather a function on the arcs, not a single value.
This patch reverts the changes of [dacc2cee2b4c] for Preflow and
Circulation.
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 29 Apr 2009 03:15:24 +0200] rev 640
Support negative costs and bounds in NetworkSimplex (#270)
* The interface is reworked to support negative costs and bounds.
- ProblemType and problemType() are renamed to
SupplyType and supplyType(), see also #234.
- ProblemType type is introduced similarly to the LP interface.
- 'bool run()' is replaced by 'ProblemType run()' to handle
unbounded problem instances, as well.
- Add INF public member constant similarly to the LP interface.
* Remove capacityMap() and boundMaps(), see also #266.
* Update the problem definition in the MCF module.
* Remove the usage of Circulation (and adaptors) for checking feasibility.
Check feasibility by examining the artifical arcs instead (after solving
the problem).
* Additional check for unbounded negative cycles found during the
algorithm (it is possible now, since negative costs are allowed).
* Fix in the constructor (the value types needn't be integer any more),
see also #254.
* Improve and extend the doc.
* Rework the test file and add test cases for negative costs and bounds.
Alpar Juttner <alpar@cs.elte.hu> [Wed, 29 Apr 2009 16:55:27 +0100] rev 639
Merge
Akos Ladanyi <ladanyi@tmit.bme.hu> [Tue, 28 Apr 2009 11:25:47 +0100] rev 638
Check the version number in FindGLPK (#277)
Akos Ladanyi <ladanyi@tmit.bme.hu> [Mon, 27 Apr 2009 18:05:04 +0100] rev 637
Add GLPK_ROOT_DIR variable to FindGLPK (#277)
Akos Ladanyi <ladanyi@tmit.bme.hu> [Tue, 28 Apr 2009 11:55:43 +0100] rev 636
Link libm and libpthread if using CPLEX (#277)
Akos Ladanyi <ladanyi@tmit.bme.hu> [Mon, 27 Apr 2009 18:03:18 +0100] rev 635
Add CPLEX_ROOT_DIR variable to FindCPLEX (#277)
Akos Ladanyi <ladanyi@tmit.bme.hu> [Tue, 28 Apr 2009 14:47:25 +0100] rev 634
Look for COIN libraries with and without the lib prefix too (#277)
This is necessary because on Windows when built using autotools the COIN
libraries are named in UNIX style, i.e. libCbc.lib insetad of Cbc.lib.
Alpar Juttner <alpar@cs.elte.hu> [Wed, 29 Apr 2009 15:54:30 +0100] rev 633
Merge
Alpar Juttner <alpar@cs.elte.hu> [Wed, 29 Apr 2009 15:52:08 +0100] rev 632
Merge
Akos Ladanyi <ladanyi@tmit.bme.hu> [Tue, 28 Apr 2009 16:44:48 +0100] rev 631
Remove superfluous HAVE_CONFIG_H (#278)
Akos Ladanyi <ladanyi@tmit.bme.hu> [Tue, 28 Apr 2009 16:49:57 +0100] rev 630
Add cbc.h to lemon/Makefile.am (#279)
Balazs Dezso <deba@inf.elte.hu> [Tue, 28 Apr 2009 12:54:59 +0200] rev 629
Fix Makefile.am EXTRA_DIST (#276)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 28 Apr 2009 14:01:00 +0100] rev 628
Merge
Akos Ladanyi <ladanyi@tmit.bme.hu> [Tue, 28 Apr 2009 13:51:34 +0100] rev 627
Merge and extend the fix of #275
Alpar Juttner <alpar@cs.elte.hu> [Sun, 26 Apr 2009 16:36:23 +0100] rev 626
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 26 Apr 2009 16:44:53 +0200] rev 625
Modify the interface of MinCostArborescence + improvements (#267)
- Rename arborescenceValue() to arborescenceCost().
- Rename DefXyz template named paramaters to SetXyz.
- Rearrange public functions (for better doc).
- Doc improvements.
- Extend the test file with interface checking.
Alpar Juttner <alpar@cs.elte.hu> [Sat, 25 Apr 2009 17:51:09 +0100] rev 624
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 25 Apr 2009 02:12:41 +0200] rev 623
Modify the interface of Suurballe (#266, #181)
- Move the parameters s and t from the constructor to the run()
function. It makes the interface capable for multiple run(s,t,k)
calls (possible improvement in the future) and it is more similar
to Dijkstra.
- Simliarly init() and findFlow(k) were replaced by init(s) and
findFlow(t,k). The separation of parameters s and t is for the
future plans of supporting multiple targets with one source node.
For more information see #181.
- LEMON_ASSERT for the Length type (check if it is integer).
- Doc improvements.
- Rearrange query functions.
- Extend test file.
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 25 Apr 2009 18:25:59 +0200] rev 622
Support infinite bounds in Circulation + fixes (#270, #266)
- Support infinite capacities.
- Bug fix in upperMap().
- Fixes and improvements in the documentation.
Akos Ladanyi <ladanyi@tmit.bme.hu> [Thu, 23 Apr 2009 07:30:40 +0100] rev 621
FindCOIN for CMake (#256)
Akos Ladanyi <ladanyi@tmit.bme.hu> [Thu, 23 Apr 2009 07:29:50 +0100] rev 620
FindCPLEX for CMake (#256)
Akos Ladanyi <ladanyi@tmit.bme.hu> [Thu, 23 Apr 2009 07:28:56 +0100] rev 619
FindGLPK improvements (#256)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 24 Apr 2009 12:12:14 +0100] rev 618
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 24 Apr 2009 11:54:48 +0200] rev 617
Fix and uniform the usage of Graph and Parent typedefs (#268)
- Rename Graph typedefs to GraphType in the implementation of graph
maps and MapExtender to prevent conflicts (especially using VS).
They are not public.
- Make Parent typedefs private in all classes.
- Replace Digraph with Graph in some places
(fix faulty renamings of the script).
- Use Graph and Digraph typedefs (more) consequently.
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 24 Apr 2009 10:15:33 +0200] rev 616
VS compatibility fix (#268)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 24 Apr 2009 12:23:53 +0200] rev 615
Exploit the changes of #190 in MCF test file (#234, #190)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 24 Apr 2009 12:23:17 +0200] rev 614
Support LEQ and GEQ supply constraints in dimacs-solver (#234, #219)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 24 Apr 2009 12:22:06 +0200] rev 613
Bug fix in NetworkSimplex (#234)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 23 Apr 2009 10:44:35 +0100] rev 612
Fix usage of sqrt() (#268)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 21 Apr 2009 15:18:54 +0100] rev 611
Merge and fix
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 17 Apr 2009 18:14:35 +0200] rev 610
Slightly modify the interface of Circulation and Preflow (#266)
in order to synchronize them to the interface of NetworkSimplex.
Circulation:
- The "delta" notation is replaced by "supply".
- lowerCapMap(), upperCapMap() are renamed to lowerMap() and upperMap().
- Value is renamed to Flow.
Preflow:
- Value is renamed to Flow.
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 17 Apr 2009 18:04:36 +0200] rev 609
Support >= and <= constraints in NetworkSimplex (#219, #234)
By default the same inequality constraints are supported as by
Circulation (the GEQ form), but the LEQ form can also be selected
using the problemType() function.
The documentation of the min. cost flow module is reworked and
extended with important notes and explanations about the different
variants of the problem and about the dual solution and optimality
conditions.
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 03 Apr 2009 18:59:15 +0200] rev 608
Support real types + numerical stability fix in NS (#254)
- Real types are supported by appropriate inicialization.
- A feature of the XTI spanning tree structure is removed to ensure
numerical stability (could cause problems using integer types).
The node potentials are updated always on the lower subtree,
in order to prevent overflow problems.
The former method isn't notably faster during to our tests.
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 03 Apr 2009 13:46:16 +0200] rev 607
Separate types for flow and cost values in NetworkSimplex (#234)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 25 Mar 2009 21:37:50 +0100] rev 606
Support multiple run() calls in NetworkSimplex (#234)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 25 Mar 2009 15:58:44 +0100] rev 605
Rework the interface of NetworkSimplex (#234)
The parameters of the problem can be set with separate functions
instead of different constructors.
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 24 Mar 2009 00:18:25 +0100] rev 604
Use XTI implementation instead of ATI in NetworkSimplex (#234)
XTI (eXtended Threaded Index) is an imporved version of the widely
known ATI (Augmented Threaded Index) method for storing and updating
the spanning tree structure in Network Simplex algorithms.
In the ATI data structure three indices are stored for each node:
predecessor, thread and depth. In the XTI data structure depth is
replaced by the number of successors and the last successor
(according to the thread index).
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 23 Mar 2009 23:54:42 +0100] rev 603
Internal restructuring and renamings in NetworkSimplex (#234)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 24 Feb 2009 09:52:26 +0100] rev 602
Support min cost flow in dimacs-solver (#234)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 24 Feb 2009 09:46:02 +0100] rev 601
Port NetworkSimplex from SVN -r3520 (#234)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 21 Apr 2009 13:08:19 +0100] rev 600
Merge
Alpar Juttner <alpar@cs.elte.hu> [Tue, 21 Apr 2009 10:34:49 +0100] rev 599
Merge
Balazs Dezso <deba@inf.elte.hu> [Sat, 18 Apr 2009 21:54:30 +0200] rev 598
Add more docs to LGF function interface (#109)
Balazs Dezso <deba@inf.elte.hu> [Sat, 18 Apr 2009 21:01:12 +0200] rev 597
Fix in HaoOrlin (#264)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 15 Apr 2009 09:37:51 +0200] rev 596
Improvements and fixes for the minimum cut algorithms (#264)
Alpar Juttner <alpar@cs.elte.hu> [Sat, 18 Apr 2009 08:51:54 +0100] rev 595
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 17 Apr 2009 09:58:50 +0200] rev 594
Rename max_matching.h to matching.h (#265)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 17 Apr 2009 09:54:14 +0200] rev 593
Extend and modify the interface of matching algorithms (#265)
- Rename decomposition() to status() in MaxMatching.
- Add a new query function statusMap() to MaxMatching.
- Add a new query function matchingMap() to all the three classes.
- Rename matchingValue() to matchingWeight() in the weighted
matching classes.
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 15 Apr 2009 11:47:19 +0200] rev 592
Improvements for the Euler tools and the test file (#264)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 15 Apr 2009 11:41:25 +0200] rev 591
Bug fix in the Euler iterators (#264)
Handle the case when the first node is isolated.
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 15 Apr 2009 12:01:14 +0200] rev 590
Imporvements for the matching algorithms (#264)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 15 Apr 2009 07:13:30 +0100] rev 589
Merge
Alpar Juttner <alpar@cs.elte.hu> [Wed, 15 Apr 2009 07:07:25 +0100] rev 588
Merge
Alpar Juttner <alpar@cs.elte.hu> [Wed, 15 Apr 2009 07:05:32 +0100] rev 587
Rotate and enlarge some images (#262)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 15 Apr 2009 04:26:13 +0200] rev 586
Add images + fixes in the doc of connectivity tools (#262)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 15 Apr 2009 03:26:45 +0200] rev 585
Improve test files for some algorithms (#263)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 15 Apr 2009 02:04:37 +0200] rev 584
Small doc improvements (#263)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 14 Apr 2009 10:40:33 +0100] rev 583
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 14 Apr 2009 10:54:42 +0200] rev 582
Remove notes about reference maps as extra features (#190)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 14 Apr 2009 10:35:38 +0200] rev 581
Exploit that the standard maps are reference maps (#190)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 14 Apr 2009 10:34:12 +0200] rev 580
Standard graph maps are required to be reference maps (#190)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 14 Apr 2009 10:33:17 +0200] rev 579
Various improvements and fixes (mainly in the doc) (#190)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 10 Apr 2009 07:29:22 +0100] rev 578
Merge
Alpar Juttner <alpar@cs.elte.hu> [Fri, 10 Apr 2009 07:29:00 +0100] rev 577
Merge
Balazs Dezso <deba@inf.elte.hu> [Wed, 08 Apr 2009 22:49:28 +0200] rev 576
Unified message handling for LP and MIP solvers (#9)
Balazs Dezso <deba@inf.elte.hu> [Thu, 09 Apr 2009 21:19:16 +0200] rev 575
Force cplex checking (#260)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 08 Apr 2009 10:42:00 +0200] rev 574
Add RangeIdMap, CrossRefMap to the rename script (#160)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 07 Apr 2009 14:50:20 +0100] rev 573
Merge
Alpar Juttner <alpar@cs.elte.hu> [Sat, 04 Apr 2009 07:30:58 +0100] rev 572
DescriptorMap->RangeIdMap, InvertableMap->CrossRefMap (#160)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 07 Apr 2009 12:56:50 +0100] rev 571
Merge
Akos Ladanyi <ladanyi@tmit.bme.hu> [Mon, 06 Apr 2009 18:51:04 +0100] rev 570
Fix compilation with MSVC (#259)
Akos Ladanyi <ladanyi@tmit.bme.hu> [Mon, 06 Apr 2009 18:51:54 +0100] rev 569
Fix compilation with MSVC (#258)
Akos Ladanyi <ladanyi@tmit.bme.hu> [Fri, 03 Apr 2009 16:58:22 +0100] rev 568
Single check macro for all COIN-OR dependencies (#204)
Balazs Dezso <deba@inf.elte.hu> [Wed, 01 Apr 2009 22:58:58 +0200] rev 567
Add CBC support (#204)
Balazs Dezso <deba@inf.elte.hu> [Thu, 02 Apr 2009 19:29:56 +0200] rev 566
Silent glp_adv_basis() (#255)
Balazs Dezso <deba@inf.elte.hu> [Wed, 01 Apr 2009 22:54:00 +0200] rev 565
Fixing presolver and basis handling (#255)
Akos Ladanyi <ladanyi@tmit.bme.hu> [Wed, 01 Apr 2009 14:18:35 +0100] rev 564
Add 'demo' make target for building the demo programs
Alpar Juttner <alpar@cs.elte.hu> [Wed, 01 Apr 2009 17:17:47 +0100] rev 563
Fix in .hgignore
Alpar Juttner <alpar@cs.elte.hu> [Tue, 31 Mar 2009 16:25:10 +0100] rev 562
Merge
Alpar Juttner <alpar@cs.elte.hu> [Mon, 30 Mar 2009 16:46:37 +0100] rev 561
Accept negative values as unbounded capacity in dimacs readers (#243)
and some doc improvements.
Alpar Juttner <alpar@cs.elte.hu> [Sun, 29 Mar 2009 22:19:14 +0100] rev 560
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 29 Mar 2009 23:08:20 +0200] rev 559
Various doc improvements (#248)
- Rename all the ugly template parameters (too long and/or starting
with an underscore).
- Rename function parameters starting with an underscore.
- Extend the doc for many classes.
- Use LaTeX-style O(...) expressions only for the complicated ones.
- A lot of small unification changes.
- Small fixes.
- Some other improvements.
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 27 Mar 2009 18:49:25 +0100] rev 558
Improve timer and counter tests (#253)
- Do not print the output of counter_test.cc.
- Check the output of counter_test.cc.
- Shorten the running time of time_measure_test.cc.
Alpar Juttner <alpar@cs.elte.hu> [Sat, 28 Mar 2009 10:36:53 +0000] rev 557
Merge
Alpar Juttner <alpar@cs.elte.hu> [Fri, 27 Mar 2009 10:34:43 +0000] rev 556
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 27 Mar 2009 07:24:52 +0100] rev 555
Fix and extend the migration script (#245)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 27 Mar 2009 07:24:18 +0100] rev 554
Bug fix in unify-sources.sh (#245)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 27 Mar 2009 09:30:22 +0000] rev 553
Merge
Akos Ladanyi <ladanyi@tmit.bme.hu> [Thu, 19 Mar 2009 15:41:29 +0000] rev 552
CMake subproject support fixes (#240)
Balazs Dezso <deba@inf.elte.hu> [Thu, 19 Mar 2009 08:40:34 +0100] rev 551
Fix lp related errors and warnings (#241 and #242)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 18 Mar 2009 16:18:05 +0000] rev 550
Switch on warnings when compiling the lib
Akos Ladanyi <ladanyi@tmit.bme.hu> [Mon, 16 Mar 2009 13:51:32 +0000] rev 549
Make it possible to use LEMON as a CMake subproject (#240)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 05 Mar 2009 10:13:20 +0000] rev 548
Merge
Alpar Juttner <alpar@cs.elte.hu> [Wed, 04 Mar 2009 14:09:45 +0000] rev 547
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 04 Mar 2009 14:56:09 +0100] rev 546
Doc improvements in GomoryHu (#66)
And make init() and start() private + bug fix in the test file.
Alpar Juttner <alpar@cs.elte.hu> [Wed, 25 Feb 2009 11:10:57 +0000] rev 545
Remane GomoryHuTree to GomoryHu (#66)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 25 Feb 2009 11:10:52 +0000] rev 544
Cut iterators for GomoryHuTree + doc cleanup + bug fixes (#66)
Janos Tapolcai <tapolcai@tmit.bme.hu> [Fri, 20 Feb 2009 17:17:17 +0100] rev 543
Porting Gomory-Hu algorithm (#66)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 04 Mar 2009 13:43:05 +0000] rev 542
Merge
Alpar Juttner <alpar@cs.elte.hu> [Sun, 01 Mar 2009 07:10:49 +0000] rev 541
Remove \bug and \todo comments
Alpar Juttner <alpar@cs.elte.hu> [Thu, 26 Feb 2009 07:39:16 +0000] rev 540
Fix newSolver()/cloneSolver() API in LP tools + doc improvements (#230)
- More logical structure for newSolver()/cloneSolver()
- Fix compilation problem with gcc-3.3
- Doc improvements
Alpar Juttner <alpar@cs.elte.hu> [Thu, 26 Feb 2009 09:39:02 +0000] rev 539
Fix Soplex config in autoconf (#230)
Balazs Dezso <deba@inf.elte.hu> [Mon, 23 Feb 2009 23:44:29 +0100] rev 538
Automatic GLPK env deallocation (#213)
Balazs Dezso <deba@inf.elte.hu> [Mon, 23 Feb 2009 22:54:25 +0100] rev 537
Fix GLPK tests (#213)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 24 Feb 2009 06:52:17 +0000] rev 536
Merge
Alpar Juttner <alpar@cs.elte.hu> [Mon, 23 Feb 2009 18:01:14 +0000] rev 535
Merge
Alpar Juttner <alpar@cs.elte.hu> [Mon, 23 Feb 2009 15:04:10 +0000] rev 534
Merge
Alpar Juttner <alpar@cs.elte.hu> [Mon, 23 Feb 2009 15:03:55 +0000] rev 533
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 23 Feb 2009 14:51:10 +0100] rev 532
Small improvements in DIMACS solver (#226)
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 23 Feb 2009 14:53:45 +0100] rev 531
Avoid warnings in test/euler_test.h (#65)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 23 Feb 2009 12:33:40 +0000] rev 530
Merge
Balazs Dezso <deba@inf.elte.hu> [Mon, 23 Feb 2009 13:12:05 +0100] rev 529
Fix the naming convention of guards and remove one unnecessary include
Alpar Juttner <alpar@cs.elte.hu> [Mon, 23 Feb 2009 12:26:21 +0000] rev 528
Merge
Alpar Juttner <alpar@cs.elte.hu> [Mon, 23 Feb 2009 11:52:45 +0000] rev 527
CMAKE builds the tools/ dir, too (#228)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 23 Feb 2009 11:49:57 +0000] rev 526
DIMACS solver utility (#226)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 23 Feb 2009 11:48:47 +0000] rev 525
dimacs.h reads MAT files to both dir and undir graphs (#231)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 23 Feb 2009 11:31:22 +0000] rev 524
Option for lgf-gen to draw the edges only
Alpar Juttner <alpar@cs.elte.hu> [Mon, 23 Feb 2009 11:30:15 +0000] rev 523
Port lgf-gen from SVN -r3512 (#45)
- apply the migrate script
- apply the source unifyer
- fix the compilation
Akos Ladanyi <ladanyi@tmit.bme.hu> [Mon, 03 Nov 2008 11:59:54 +0000] rev 522
Test for euler.h (#65)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 23 Feb 2009 11:30:15 +0000] rev 521
Rename euler() to eulerian() (#65)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 23 Feb 2009 11:30:15 +0000] rev 520
Port Euler walk tools from SVN -r3512 (#65)
Balazs Dezso <deba@inf.elte.hu> [Mon, 23 Feb 2009 11:58:39 +0100] rev 519
Fix several missing includes (#232)
Alpar Juttner <alpar@cs.elte.hu> [Sun, 22 Feb 2009 09:52:44 +0000] rev 518
Merge
Alpar Juttner <alpar@cs.elte.hu> [Fri, 20 Feb 2009 21:37:19 +0000] rev 517
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 16 Oct 2009 10:21:37 +0200] rev 516
Use pathCopy(from,to) instead of copyPath(to,from) (#321)
The old version is kept as a deprecated alternative.
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 12 Jan 2009 23:11:39 +0100] rev 515
Slightly simplify adaptors_test.cc
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 12 Oct 2009 13:41:15 +0200] rev 514
Fix in pathSource() and pathTarget() (#250)
and extend the doc.
Akos Ladanyi <ladanyi@tmit.bme.hu> [Tue, 18 Aug 2009 21:39:35 +0100] rev 513
Remove duplicate list_graph.h entry from source list (#308)
Akos Ladanyi <ladanyi@tmit.bme.hu> [Tue, 28 Apr 2009 18:45:29 +0100] rev 512
Do not distribute lemon/config.h and fix its bad include by core.h (#280)
Akos Ladanyi <ladanyi@tmit.bme.hu> [Mon, 27 Apr 2009 20:02:37 +0100] rev 511
Prefix macro names with LEMON_ in lemon/config.h (#275)
Akos Ladanyi <ladanyi@tmit.bme.hu> [Tue, 28 Apr 2009 13:38:06 +0100] rev 510
Install lemon/config.h (#274)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 27 Apr 2009 11:24:44 +0100] rev 509
unify-sources.sh refresh the dates according to the last modification
Alpar Juttner <alpar@cs.elte.hu> [Tue, 31 Mar 2009 16:05:54 +0100] rev 508
Small script making a release
Alpar Juttner <alpar@cs.elte.hu> [Sat, 28 Mar 2009 10:28:16 +0000] rev 507
LEMON is a COIN-OR project now
Alpar Juttner <alpar@cs.elte.hu> [Tue, 10 Mar 2009 13:18:42 +0100] rev 506
Minor fix in the LICENSE file
Alpar Juttner <alpar@cs.elte.hu> [Thu, 05 Mar 2009 06:51:53 +0000] rev 505
Fix missing 'inline' specifier in time_measure.h (#239)
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 02 Feb 2009 13:06:36 +0100] rev 504
Also note the cmake based build environment in INSTALL file
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 23 Feb 2009 12:10:26 +0100] rev 503
Various doc improvements
Alpar Juttner <alpar@cs.elte.hu> [Mon, 23 Feb 2009 15:46:57 +0000] rev 502
Include /lemon/config.h globally (#230)
Balazs Dezso <deba@inf.elte.hu> [Tue, 02 Dec 2008 23:33:47 +0100] rev 501
Port MinCostArborescence algorithm from SVN #3509
Alpar Juttner <alpar@cs.elte.hu> [Wed, 04 Feb 2009 09:39:06 +0100] rev 500
CMAKE config improvements
- install docs in share/doc/
- look for newer versions of Ghostscript
Alpar Juttner <alpar@cs.elte.hu> [Fri, 20 Feb 2009 20:43:13 +0000] rev 499
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 20 Feb 2009 20:36:26 +0000] rev 498
Various fixes for compiling on AIX (#211, #212)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 20 Feb 2009 18:06:10 +0000] rev 497
Default implementation of Tolerance<> is used for integer types (#229)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 20 Feb 2009 18:06:10 +0000] rev 496
Add long long checking to build systems (#230)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 20 Feb 2009 18:43:34 +0100] rev 495
Fixes in adaptors.h to compile on AIX
Alpar Juttner <alpar@cs.elte.hu> [Fri, 20 Feb 2009 06:59:00 +0000] rev 494
Add cmake/cmake.version to .hgignore
Janos Tapolcai <tapolcai@tmit.bme.hu> [Tue, 17 Feb 2009 18:10:07 +0100] rev 493
Further fixes to windows.cc (#215)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 16 Feb 2009 18:15:52 +0000] rev 492
Merge
Alpar Juttner <alpar@cs.elte.hu> [Mon, 16 Feb 2009 15:03:32 +0000] rev 491
Wrap around the usages of windows.h
Janos Tapolcai <tapolcai@tmit.bme.hu> [Fri, 23 Jan 2009 18:40:41 +0100] rev 490
Dirty hacking for VS 2005 in lp_base.h (#209)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 13 Feb 2009 16:05:21 +0000] rev 489
Merge
Balazs Dezso <deba@inf.elte.hu> [Fri, 13 Feb 2009 13:29:28 +0100] rev 488
Fixes for MSVC 2008 in grap_adaptors.h and edge_set.h (#194)
Several renamings and changes in adaptors and edge sets
- Fixing scope usage for MSVC
- ResidualDigraph based on SubDigraph instead of FilterArcs
- Use initialize() in adaptors and edge sets
- Wrap ListDigraph for edge set tests
Alpar Juttner <alpar@cs.elte.hu> [Fri, 13 Feb 2009 15:01:09 +0000] rev 487
Change LEMON's isnan() to isNaN() for the sake of AIX/xlC
Certain xlC versions implement isnan() as a #define.
Alpar Juttner <alpar@cs.elte.hu> [Fri, 13 Feb 2009 14:56:27 +0000] rev 486
Fix in lp_base.cc targeting AIX/xlC compatibility
Alpar Juttner <alpar@cs.elte.hu> [Tue, 10 Feb 2009 17:37:59 +0000] rev 485
Merge
Alpar Juttner <alpar@cs.elte.hu> [Tue, 10 Feb 2009 17:21:26 +0000] rev 484
Set the compatibily related MSVC defines only if they has't been defined yet
Janos Tapolcai <tapolcai@tmit.bme.hu> [Tue, 10 Feb 2009 15:43:39 +0100] rev 483
Compilation bug fixed in graph_to_eps.h with VS2005 (#214)
Alpar Juttner <alpar@cs.elte.hu> [Sat, 07 Feb 2009 15:30:04 +0000] rev 482
Add missing include to time_measure.h
Alpar Juttner <alpar@cs.elte.hu> [Fri, 23 Jan 2009 16:42:07 +0000] rev 481
Merge (manually add cmake/FindGLPK.cmake to Makefile.am)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 23 Jan 2009 16:30:05 +0000] rev 480
Set the proper version for CMAKE in the tarballs (made by autotools).
Akos Ladanyi <ladanyi@tmit.bme.hu> [Thu, 22 Jan 2009 10:39:13 +0000] rev 479
Enable the component-based installer
Akos Ladanyi <ladanyi@tmit.bme.hu> [Thu, 22 Jan 2009 10:39:56 +0000] rev 478
Update the lemon icon
Alpar Juttner <alpar@cs.elte.hu> [Thu, 22 Jan 2009 14:46:15 +0000] rev 477
Suppress or fix VS2008 warnings + turn off faulty tests using CMAKE (#208)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 21 Jan 2009 18:18:41 +0000] rev 476
Merge
Akos Ladanyi <ladanyi@tmit.bme.hu> [Wed, 21 Jan 2009 18:06:17 +0000] rev 475
Fix 'make install' without 'make html' using CMAKE (#207)
Akos Ladanyi <ladanyi@tmit.bme.hu> [Wed, 21 Jan 2009 18:08:31 +0000] rev 474
Fix CMAKE build without GLPK
Akos Ladanyi <ladanyi@tmit.bme.hu> [Tue, 20 Jan 2009 12:23:14 +0000] rev 473
Build GLPK dependent parts with CMake too
Alpar Juttner <alpar@cs.elte.hu> [Mon, 19 Jan 2009 11:42:15 +0000] rev 472
(.hg)ignore more build-like dirs (*objs* and *build*)
Balazs Dezso <deba@inf.elte.hu> [Sun, 18 Jan 2009 17:49:08 +0100] rev 471
Fix lp indexing bug (#205)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 14 Jan 2009 15:55:29 +0000] rev 470
Own support for isnan()
Alpar Juttner <alpar@cs.elte.hu> [Mon, 12 Jan 2009 13:37:37 +0000] rev 469
Merge
Balazs Dezso <deba@inf.elte.hu> [Mon, 08 Dec 2008 11:38:02 +0100] rev 468
ArcSet and EdgeSet ports from SVN 3489 (ticket #67)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 12 Jan 2009 13:18:03 +0000] rev 467
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 12 Jan 2009 09:53:12 +0100] rev 466
Rename graph adaptors with the migration script (#67)
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 12 Jan 2009 08:18:04 +0100] rev 465
Rename graph_adaptor_test.cc to adaptors_test.cc (#67)
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 12 Jan 2009 08:05:30 +0100] rev 464
Rename Residual to ResidualDigraph (#67)
The new name is more analogous to other adaptor names.
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 12 Jan 2009 07:52:48 +0100] rev 463
Greatly extend and improve the test file for adaptors (#67)
- Add concept checks for the alterable, extendable, erasable
and clearable adaptors.
- Add test cases for modifying the underlying graphs through adaptors
whenever it is possible.
- Check the conversions between Node, Arc and Edge types.
- Add more test cases for the adaptor-specific functions and maps:
enable(), disable(), status(), forward(), backward(), CombinedArcMap,
CombinedNodeMap, ResidualCapacity etc.
- Use checkGraphIncEdgeArcLists() to simplify the test cases for
undirected graphs.
- Add test cases that use static graph structure (GridGraph) with
several adaptors combined.
- Add comments for the test cases.
Alpar Juttner <alpar@cs.elte.hu> [Mon, 12 Jan 2009 12:26:02 +0000] rev 462
Rename Lp*/Mip* to *Lp/*Mip
Alpar Juttner <alpar@cs.elte.hu> [Mon, 12 Jan 2009 12:26:01 +0000] rev 461
Remove lp_ prefix from the solver's header name
Alpar Juttner <alpar@cs.elte.hu> [Mon, 12 Jan 2009 12:25:55 +0000] rev 460
Bypass warnings with gcc 4.3
Balazs Dezso <deba@inf.elte.hu> [Tue, 02 Dec 2008 22:48:28 +0100] rev 459
Thorough redesign of the LP/MIP interface (#44)
- Redesigned class structure
- Redesigned iterators
- Some functions in the basic interface redesigned
- More complete setting functions
- Ray retrieving functions
- Lot of improvements
- Cplex common env
- CLP macro definition to config.h.in
- Update lp.h to also use soplex and clp
- Remove default_solver_name
- New solverName() function in solvers
- Handle exceptions for MipCplex test
- Rename tolerance parameter to epsilon
- Rename MapIt to CoeffIt
- Lot of documentation improvements
- Various bugfixes
Balazs Dezso <deba@inf.elte.hu> [Tue, 02 Dec 2008 21:40:33 +0100] rev 458
Port LP and MIP solvers from SVN -r3509 (#44)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 12 Jan 2009 12:22:11 +0000] rev 457
Add HAVE_LP and HAVE_MIP #defines
Alpar Juttner <alpar@cs.elte.hu> [Mon, 12 Jan 2009 12:22:11 +0000] rev 456
Ignore standard .m4 files
Alpar Juttner <alpar@cs.elte.hu> [Sun, 11 Jan 2009 15:09:53 +0000] rev 455
Merge
Alpar Juttner <alpar@cs.elte.hu> [Sun, 11 Jan 2009 15:03:14 +0000] rev 454
Update lemon/adaptors.h's header to 2009
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 11 Jan 2009 15:24:20 +0100] rev 453
Remove non-checked subgraph adaptors + rename parameters (#67)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 09 Jan 2009 14:03:25 +0100] rev 452
Rename convenience functions in subgraph adaptors (#67)
- Rename hide(), unHide() to disable(), enable().
- Add new set function status(Item, bool).
- Remove hidden() and add status() instead
(which returns the opposite value).
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 09 Jan 2009 12:54:27 +0100] rev 451
Various doc improvements for graph adaptors (#67)
- Add notes about modifying the adapted graphs through adaptors
if it is possible.
- Add notes about the possible conversions between the Node, Arc and
Edge types of the adapted graphs and the adaptors.
- Hide the default values for template parameters (describe them
in the doc instead).
- More precise docs for template parameters.
- More precise docs for member functions.
- Add docs for important public typedefs.
- Unify the docs of the adaptors.
- Add \relates commands for the creator functions.
- Fixes and improvements the module documentation.
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 09 Jan 2009 12:43:52 +0100] rev 450
Add creator functions for Residual and Residual::ResidualCapacity (#67)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 12 Dec 2008 22:59:17 +0100] rev 449
Various bug fixes and code improvements in adaptors.h (#67)
- Fix UndirectorBase::nodeNum().
- Fix UndirectorBase::findEdge().
- Fix OrienterBase::addArc().
- Fix OrienterBase::findArc().
- Improve SplitNodesBase::findArc().
- Add missing notifier() function in UndirectorBase.
- Add missing typedefs for maps (conform to the ReferenceMap concept).
- Add some useful typedefs for graph adaptors.
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 12 Dec 2008 22:18:41 +0100] rev 448
Add missing const keywords (+ remove misleading ones) (#67)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 12 Dec 2008 22:09:29 +0100] rev 447
Avoid warning in adaptors.h (#67)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 12 Dec 2008 22:00:03 +0100] rev 446
Fix the usage of tags in adaptors.h (#67)
There are separate tags for arcs and edges now.
Alpar Juttner <alpar@cs.elte.hu> [Thu, 08 Jan 2009 17:19:26 +0000] rev 445
Merge
Alpar Juttner <alpar@cs.elte.hu> [Thu, 08 Jan 2009 17:10:42 +0000] rev 444
Update to 2009 plus whitespace unification
Balazs Dezso <deba@inf.elte.hu> [Tue, 02 Dec 2008 23:15:43 +0100] rev 443
Rename counterSort to stableRadixSort
Alpar Juttner <alpar@cs.elte.hu> [Tue, 02 Dec 2008 10:17:30 +0000] rev 442
Doc improvements and source unification in radix_sort (#72)
Balazs Dezso <deba@inf.elte.hu> [Fri, 17 Oct 2008 23:55:18 +0200] rev 441
Porting radix sorts from SVN #3509
Alpar Juttner <alpar@cs.elte.hu> [Thu, 01 Jan 2009 00:00:00 +0100] rev 440
Happy New Year again
- update the copyright headers + run the source unifier
Balazs Dezso <deba@inf.elte.hu> [Sun, 21 Dec 2008 20:47:15 +0100] rev 439
Merge bugfix #197
Balazs Dezso <deba@inf.elte.hu> [Sun, 21 Dec 2008 20:45:25 +0100] rev 438
Bug fix in heap unionfind (ticket #197)
The previous bugfix set the minimum value in internal nodes
wrongly. It corrects the problem.
Balazs Dezso <deba@inf.elte.hu> [Sun, 21 Dec 2008 00:16:46 +0100] rev 437
Merge bugfix #197
Balazs Dezso <deba@inf.elte.hu> [Sun, 21 Dec 2008 00:13:02 +0100] rev 436
Bug fix in heap unionfind (ticket #197)
The minimum item in the unionfind tree might become inconsistent when
the split operation merges two subtrees which have equal keys. The
current changeset fix the problem. It also fix a wrong index.
Alpar Juttner <alpar@cs.elte.hu> [Fri, 12 Dec 2008 22:16:17 +0000] rev 435
Merge
Alpar Juttner <alpar@cs.elte.hu> [Fri, 12 Dec 2008 22:14:29 +0000] rev 434
Merge
Alpar Juttner <alpar@cs.elte.hu> [Fri, 12 Dec 2008 21:58:45 +0000] rev 433
Merge
Alpar Juttner <alpar@cs.elte.hu> [Fri, 12 Dec 2008 21:41:05 +0000] rev 432
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 12 Dec 2008 21:46:08 +0100] rev 431
Hide all docs in variant.h (#196)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 12 Dec 2008 21:44:37 +0100] rev 430
Bug fix in variant.h (#196)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 12 Dec 2008 21:37:22 +0100] rev 429
Bug fix in ConEdgeIt (#195)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 08 Dec 2008 21:50:34 +0000] rev 428
Merge
Balazs Dezso <deba@inf.elte.hu> [Mon, 08 Dec 2008 20:23:33 +0100] rev 427
Fix skipSection() function (ticket #193)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 08 Dec 2008 15:47:20 +0000] rev 426
Merge
Balazs Dezso <deba@inf.elte.hu> [Mon, 08 Dec 2008 11:06:39 +0100] rev 425
Fix typos (ticket #192)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 08 Dec 2008 12:29:00 +0000] rev 424
Update test/CMakeLists.txt and test/Makefile.am
Alpar Juttner <alpar@cs.elte.hu> [Mon, 08 Dec 2008 15:18:04 +0000] rev 423
Inline the test input files into the source code
Alpar Juttner <alpar@cs.elte.hu> [Fri, 05 Dec 2008 13:10:16 +0000] rev 422
chg-len.py does not scan any hg config file now
Alpar Juttner <alpar@cs.elte.hu> [Fri, 05 Dec 2008 10:38:32 +0000] rev 421
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 05 Dec 2008 00:22:47 +0100] rev 420
Add missing 'const' for query functions of algorithms
Balazs Dezso <deba@inf.elte.hu> [Wed, 03 Dec 2008 14:23:22 +0100] rev 419
Renamings in connectivity.h and bug fix in DfsVisit (#61)
- The include guard, the private namespace and some local varibles
are renamed
- The stop() must be called in DfsVisit, if there are not outgoing
arcs from the added node
Alpar Juttner <alpar@cs.elte.hu> [Tue, 02 Dec 2008 15:33:22 +0000] rev 418
Merge
Balazs Dezso <deba@inf.elte.hu> [Sun, 30 Nov 2008 22:06:52 +0100] rev 417
Port topology.h as connectivity.h from SVN -r3509 (#61)
Balazs Dezso <deba@inf.elte.hu> [Sun, 30 Nov 2008 19:18:32 +0100] rev 416
Reorganication of graph adaptors and doc improvements (#67)
- Moving to one file, lemon/adaptors.h
- Renamings
- Doc cleanings
Balazs Dezso <deba@inf.elte.hu> [Sun, 30 Nov 2008 19:00:30 +0100] rev 415
Improvements in graph adaptors (#67)
Remove DigraphAdaptor and GraphAdaptor
Remove docs of base classes
Move the member documentations to real adaptors
Minor improvements in documentation
Balazs Dezso <deba@inf.elte.hu> [Sun, 30 Nov 2008 18:57:18 +0100] rev 414
Port graph adaptors from svn -r3498 (#67)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 02 Dec 2008 11:01:48 +0000] rev 413
Merge
Alpar Juttner <alpar@cs.elte.hu> [Tue, 02 Dec 2008 10:57:23 +0000] rev 412
Minor doc improvements in HaoOrlin (#58)
Balazs Dezso <deba@inf.elte.hu> [Tue, 02 Dec 2008 08:21:47 +0100] rev 411
New queue implementation for HaoOrlin class (#58)
Balazs Dezso <deba@inf.elte.hu> [Mon, 01 Dec 2008 23:15:15 +0100] rev 410
Simple test for HaoOrlin algorithm class (#58)
Balazs Dezso <deba@inf.elte.hu> [Mon, 01 Dec 2008 23:12:16 +0100] rev 409
Port Hao-Orlin algorithm from SVN -r3509 (#58)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 02 Dec 2008 10:31:20 +0000] rev 408
Merge
Alpar Juttner <alpar@cs.elte.hu> [Tue, 02 Dec 2008 10:30:52 +0000] rev 407
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 30 Nov 2008 21:53:24 +0100] rev 406
Improvements in groups.dox (#188)
- Unify the notations used for formulas.
- Add 'namespace lemon {...}' to simplify the references.
- Improved doc for algorithm groups.
- Extend the doc of the "shortest path" and "minimum cost flow" modules.