Changelog - showing 20 out of 988 revisions
Open new pull request
revisions
gravatar ladanyi@tmit.bme.hu r674:20dac2104519
15 years ago
Merge and extend the fix of #275
↓ Show more ↓
gravatar alpar (Alpar Juttner) r673:58357e986a08
15 years ago
Merge
↓ Show more ↓
gravatar kpeter (Peter Kovacs) r672:029a48052c67
15 years ago
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.
↓ Show more ↓
gravatar alpar (Alpar Juttner) r671:1f631044c290
15 years ago
Merge
↓ Show more ↓
gravatar kpeter (Peter Kovacs) r670:7c1324b35d89
15 years ago
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.
↓ Show more ↓
gravatar kpeter (Peter Kovacs) r669:28f58740b6f8
15 years ago
Support infinite bounds in Circulation + fixes (#270, #266) - Support infinite capacities. - Bug fix in upperMap(). - Fixes and improvements in the documentation.
↓ Show more ↓
gravatar ladanyi@tmit.bme.hu r668:b536eaacb39b
15 years ago
FindCOIN for CMake (#256)
↓ Show more ↓
gravatar ladanyi@tmit.bme.hu r667:c3ce597c11ae
15 years ago
FindCPLEX for CMake (#256)
↓ Show more ↓
gravatar ladanyi@tmit.bme.hu r666:ec817dfc2cb7
15 years ago
FindGLPK improvements (#256)
↓ Show more ↓
gravatar alpar (Alpar Juttner) r665:b95898314e09
15 years ago
Merge
↓ Show more ↓
gravatar kpeter (Peter Kovacs) r664:4137ef9aacc6
15 years ago
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.
↓ Show more ↓
gravatar kpeter (Peter Kovacs) r663:f2d6d3446adf
15 years ago
VS compatibility fix (#268)
↓ Show more ↓
gravatar kpeter (Peter Kovacs) r662:e3d9bff447ed
15 years ago
Exploit the changes of #190 in MCF test file (#234, #190)
↓ Show more ↓
gravatar kpeter (Peter Kovacs) r661:19b6f20e0ea2
15 years ago
Support LEQ and GEQ supply constraints in dimacs-solver (#234, #219)
↓ Show more ↓
gravatar kpeter (Peter Kovacs) r660:b1811c363299
15 years ago
Bug fix in NetworkSimplex (#234)
↓ Show more ↓
gravatar alpar (Alpar Juttner) r659:0c8e5c688440
15 years ago
Fix usage of sqrt() (#268)
↓ Show more ↓
gravatar alpar (Alpar Juttner) r658:85cb3aa71cce
15 years ago
Merge and fix
↓ Show more ↓
gravatar kpeter (Peter Kovacs) r657:dacc2cee2b4c
15 years ago
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.
↓ Show more ↓
gravatar kpeter (Peter Kovacs) r656:e6927fe719e6
15 years ago
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.
↓ Show more ↓
gravatar kpeter (Peter Kovacs) r655:6ac5d9ae1d3d
15 years ago
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.
↓ Show more ↓
< 1 .. 17 18 19 20 21 .. 50 >