|
|
@914:35ba7236bd67
|
14 years |
Alpar Juttner |
Merge
|
|
|
@913:5087694945e4
|
14 years |
Balazs Dezso |
New implementation for Nagamochi-Ibaraki algorithm
|
|
|
@909:48e29534cf03
|
14 years |
Alpar Juttner |
The deafult target doesn't build lp_test and mip_test (#388)
|
|
|
@907:1937b6455b7d
|
14 years |
Alpar Juttner |
Merge bugfix #392
|
|
|
@906:e24922c56bc2
|
14 years |
Alpar Juttner |
Bug fix in Dfs::start(s,t) (#392)
|
|
|
@905:de428ebb47ab
|
14 years |
Alpar Juttner |
Merge #380
|
|
|
@904:c279b19abc62
|
14 years |
Peter Kovacs |
Add a heuristic algorithm for the max clique problem (#380)
|
|
|
@901:63e4468c680e
|
14 years |
Alpar Juttner |
Add 'Maintainer' CMAKE build type (#388, #390)
- some extra warning …
|
|
|
@897:e20fecd1945f
|
14 years |
Akos Ladanyi |
Add check target for CMake (#388)
|
|
|
@894:24b3f18ed9e2
|
14 years |
Peter Kovacs |
Improve graph_copy_test.cc
|
|
|
@893:d395358592df
|
14 years |
Alpar Juttner |
Merge bugfix #371
|
|
|
@890:bb871cb8ac06
|
14 years |
Peter Kovacs |
Bug fix in (di)graphCopy() (#371)
The target graph is cleared before …
|
|
|
@880:b89e46862dc2
|
15 years |
Alpar Juttner |
Merge backout of a6eb9698c321 (#360,#51)
|
|
|
@878:d6052a9c4e8d
|
15 years |
Alpar Juttner |
Backed out changeset a6eb9698c321 (#360, #51)
|
|
|
@877:141f9c0db4a3
|
15 years |
Alpar Juttner |
Unify the sources (#339)
|
|
|
@874:d8ea85825e02
|
15 years |
Alpar Juttner |
Merge #314
|
|
|
@872:41d7ac528c3a
|
15 years |
Balazs Dezso |
Uniforming primal scale to 2 (#314)
|
|
|
@870:61120524af27
|
15 years |
Balazs Dezso |
Fractional matching initialization of weighted matchings (#314)
|
|
|
@869:636dadefe1e6
|
15 years |
Balazs Dezso |
Add fractional matching algorithms (#314)
|
|
|
@864:d3ea191c3412
|
15 years |
Peter Kovacs |
Rename min mean cycle classes and their members (#179)
with respect to …
|
|
|
@858:9f6ed854d409
|
15 years |
Peter Kovacs |
Also test fullInit() in suurballe_test (#181, #323)
|
|
|
@857:abb95d48e89e
|
15 years |
Peter Kovacs |
Add traits class + named parameters to Suurballe (#323)
The following …
|
|
|
@855:65a0521e744e
|
15 years |
Peter Kovacs |
Rename heap structures (#301)
- KaryHeap? --> DHeap
- FouraryHeap? …
|
|
|
@854:9a7e4e606f83
|
15 years |
Peter Kovacs |
Add a fullInit() function to Suurballe (#181, #323)
to provide faster …
|
|
|
@844:a6eb9698c321
|
15 years |
Peter Kovacs |
Support tolerance technique for BellmanFord? (#51)
A new operation …
|
|
|
@830:75c97c3786d6
|
15 years |
Peter Kovacs |
Handle graph changes in the MCF algorithms (#327)
The reset() …
|
|
|
@819:d93490b861e9
|
15 years |
Peter Kovacs |
Adds tests for the new MCF algorithms (#180)
|
|
|
@818:bc75ee2ad082
|
15 years |
Peter Kovacs |
Rework the MCF test file to help extending it (#180)
|
|
|
@799:6be1f9bd2ac0
|
15 years |
Alpar Juttner |
Merge #62
|
|
|
@798:58c330ad0b5c
|
15 years |
Balazs Dezso |
Planarity checking function instead of class (#62)
|
|
|
@797:30cb42e3e43a
|
15 years |
Balazs Dezso |
Port planarity related algorithms from SVN 3509 (#62)
|
|
|
@793:7c0ad6bd6a63
|
15 years |
Akos Ladanyi |
Optionally use valgrind when running tests + other build system fixes
|
|
|
@791:4e3484a2e90c
|
15 years |
Alpar Juttner |
Merge
|
|
|
@790:1870cfd14fb6
|
15 years |
Alpar Juttner |
Fix gcc-4.4 compilation warning
|
|
|
@789:8ddb7deabab9
|
15 years |
Peter Kovacs |
Map utility functions (#320)
|
|
|
@783:ef88c0a30f85
|
15 years |
Alpar Juttner |
Merge #293
|
|
|
@781:6f10c6ec5a21
|
15 years |
Peter Kovacs |
Small fixes related to BellmanFord? (#51)
- Add a missing #include.
…
|
|
|
@780:580af8cf2f6a
|
15 years |
Alpar Juttner |
Merge #68 (Port static graph implementation)
|
|
|
@777:5764dd9b6e18
|
15 years |
Peter Kovacs |
Add a new build() function to StaticDigraph? (#68)
This function …
|
|
|
@776:eff1caf6d32e
|
15 years |
Peter Kovacs |
Extend the interface of StaticDigraph? (#68)
with index(), arc() and …
|
|
|
@774:f4b5c2d5449d
|
15 years |
Peter Kovacs |
Small improvements + add tests for StaticDigraph? (#68)
|
|
|
@770:432c54cec63c
|
15 years |
Alpar Juttner |
Merge #179 (Port the min mean cycle algorithms)
|
|
|
@769:e746fb14e680
|
15 years |
Peter Kovacs |
Add tolerance() functions for MMC classes (#179)
|
|
|
@766:97744b6dabf8
|
15 years |
Peter Kovacs |
Add HartmannOrlin? algorithm class (#179)
This algorithm is an improved …
|
|
|
@765:3b544a9c92db
|
15 years |
Peter Kovacs |
Add Karp algorithm class (#179)
based on the MinMeanCycle? …
|
|
|
@764:1fac515a59c1
|
15 years |
Peter Kovacs |
Rename MinMeanCycle? to Howard (#179)
|
|
|
@763:93cd93e82f9b
|
15 years |
Peter Kovacs |
Add a detailed test file for MinMeanCycle? and fix test_tools.h (#179)
|
|
|
@748:4792459983d0
|
15 years |
Alpar Juttner |
Fix (and improve) error message in mip_test.cc (#317)
|
|
|
@740:819ca5b50de0
|
15 years |
Peter Kovacs |
Add a warning for List(Di)Graph::Snapshot (#311)
and extend tests for …
|
|
|
@737:9d6c3e8b2421
|
15 years |
Peter Kovacs |
Add a resize() function to HypercubeGraph? (#311)
just like the similar …
|
|
|
@736:2e20aad15754
|
15 years |
Peter Kovacs |
Add reserve functions to ListGraph? and SmartGraph? (#311)
ListDigraph? …
|
|
|
@726:3fc2a801c39e
|
15 years |
Alpar Juttner |
Merge #302
|
|
|
@724:d8073df341f6
|
15 years |
Peter Kovacs |
Rename ValueIterator? to ValueIt? in graph maps (#302)
but keep …
|
|
|
@723:acdd0bd75a55
|
15 years |
Peter Kovacs |
Extend maps_test.cc (#302)
|
|
|
@721:99124ea4f048
|
15 years |
Peter Kovacs |
Merge
|
|
|
@720:6e8c27ee9079
|
15 years |
Peter Kovacs |
Improvements for graph maps (#302)
- Add a count() function to …
|
|
|
@702:bdc7dfc8c054
|
15 years |
Peter Kovacs |
Bug fix in PairingHeap::pop() (#301)
|
|
|
@701:d1a9224f1e30
|
15 years |
Peter Kovacs |
Add fourary, k-ary, pairing and binomial heaps (#301)
These structures …
|
|
|
@699:75325dfccf38
|
15 years |
Peter Kovacs |
Add negativeCycle() function to BellmanFord? (#51)
|
|
|
@698:f9746e45246e
|
15 years |
Peter Kovacs |
Add a detailed test file for BellmanFord? (#51)
|
|
|
@695:8dae88c5943e
|
15 years |
Alpar Juttner |
Merge
|
|
|
@694:71939d63ae77
|
15 years |
Peter Kovacs |
Improvements for iterable maps (#73)
|
|
|
@693:7bda7860e0a8
|
15 years |
Balazs Dezso |
Port iterable maps from SVN 3509 (#73)
|
|
|
@689:86c49553fea5
|
15 years |
Peter Kovacs |
Test file + doc improvements (#307)
|
|
|
@684:7b1a6e963018
|
15 years |
Peter Kovacs |
Fix the implementation and doc of CrossRefMap? (#302)
- Handle …
|
|
|
@681:532697c9fa53
|
15 years |
Balazs Dezso |
Port remaining heaps from SVN -r 3509 (#50)
- FibHeap?
- RadixHeap?
…
|
|
|
@679:9c7639f3a741
|
15 years |
Akos Ladanyi |
Minor CMake improvements
* Use the empty ELSE(), ENDIF(), ENDMACRO(), …
|
|
|
@669:4faca85d40e6
|
16 years |
Peter Kovacs |
Avoid Intel C++ Compiler warnings
|
|
|
@664:cc61d09f053b
|
16 years |
Peter Kovacs |
Extend min cost flow test file + check dual costs (#291)
|
|
|
@649:76cbcb3e9bbb
|
16 years |
Peter Kovacs |
Add a test file for the connectivity functions (#285)
The Euler tools …
|
|
|
@642:111698359429
|
16 years |
Peter Kovacs |
Less map copying in NetworkSimplex? (#234)
- The graph is copied in …
|
|
|
@640:6c408d864fa1
|
16 years |
Peter Kovacs |
Support negative costs and bounds in NetworkSimplex? (#270)
* The …
|
|
|
@631:d21b38647e53
|
16 years |
Akos Ladanyi |
Remove superfluous HAVE_CONFIG_H (#278)
|
|
|
@627:20dac2104519
|
16 years |
Akos Ladanyi |
Merge and extend the fix of #275
|
|
|
@625:029a48052c67
|
16 years |
Peter Kovacs |
Modify the interface of MinCostArborescence? + improvements (#267)
- …
|
|
|
@623:7c1324b35d89
|
16 years |
Peter Kovacs |
Modify the interface of Suurballe (#266, #181)
- Move the parameters …
|
|
|
@621:b536eaacb39b
|
16 years |
Akos Ladanyi |
FindCOIN for CMake (#256)
|
|
|
@620:c3ce597c11ae
|
16 years |
Akos Ladanyi |
FindCPLEX for CMake (#256)
|
|
|
@619:ec817dfc2cb7
|
16 years |
Akos Ladanyi |
FindGLPK improvements (#256)
|
|
|
@615:e3d9bff447ed
|
16 years |
Peter Kovacs |
Exploit the changes of #190 in MCF test file (#234, #190)
|
|
|
@611:85cb3aa71cce
|
16 years |
Alpar Juttner |
Merge and fix
|
|
|
@610:dacc2cee2b4c
|
16 years |
Peter Kovacs |
Slightly modify the interface of Circulation and Preflow (#266)
in …
|
|
|
@609:e6927fe719e6
|
16 years |
Peter Kovacs |
Support >= and <= constraints in NetworkSimplex? (#219, #234)
By …
|
|
|
@607:9ad8d2122b50
|
16 years |
Peter Kovacs |
Separate types for flow and cost values in NetworkSimplex? (#234)
|
|
|
@606:c7d160f73d52
|
16 years |
Peter Kovacs |
Support multiple run() calls in NetworkSimplex? (#234)
|
|
|
@605:5232721b3f14
|
16 years |
Peter Kovacs |
Rework the interface of NetworkSimplex? (#234)
The parameters of the …
|
|
|
@601:e8349c6f12ca
|
16 years |
Peter Kovacs |
Port NetworkSimplex? from SVN -r3520 (#234)
|
|
|
@600:0ba8dfce7259
|
16 years |
Alpar Juttner |
Merge
|
|
|
@597:2ca0cdb5f366
|
16 years |
Balazs Dezso |
Fix in HaoOrlin? (#264)
|
|
|
@596:293551ad254f
|
16 years |
Peter Kovacs |
Improvements and fixes for the minimum cut algorithms (#264)
|
|
|
@594:d657c71db7db
|
16 years |
Peter Kovacs |
Rename max_matching.h to matching.h (#265)
|
|
|
@593:7ac52d6a268e
|
16 years |
Peter Kovacs |
Extend and modify the interface of matching algorithms (#265)
- …
|
|
|
@592:2ebfdb89ec66
|
16 years |
Peter Kovacs |
Improvements for the Euler tools and the test file (#264)
|
|
|
@590:b61354458b59
|
16 years |
Peter Kovacs |
Imporvements for the matching algorithms (#264)
|
|
|
@585:65fbcf2f978a
|
16 years |
Peter Kovacs |
Improve test files for some algorithms (#263)
|
|
|
@581:aa1804409f29
|
16 years |
Peter Kovacs |
Exploit that the standard maps are reference maps (#190)
|
|
|
@575:3cbddc293cf9
|
16 years |
Balazs Dezso |
Force cplex checking (#260)
|
|
|
@572:be6646ac5d89
|
16 years |
Alpar Juttner |
DescriptorMap?->RangeIdMap?, InvertableMap?->CrossRefMap? (#160)
|
|
|
@567:3314f58e7b25
|
16 years |
Balazs Dezso |
Add CBC support (#204)
|
|
|
@564:eda12d8ac953
|
16 years |
Akos Ladanyi |
Add 'demo' make target for building the demo programs
|
|
|