COIN-OR::LEMON - Graph Library

Timeline



07/22/10:

08:15 Ticket #382 (LGF without arc maps) created by Peter Kovacs
Arc maps are not obligatory in LGF. However, it is problematic, if you …

07/21/10:

15:41 Ticket #381 (Simplified heaps without priority update) created by Peter Kovacs
The existing heap implementations in LEMON cointain an Item->int map …
14:50 Ticket #380 (A heuristic algorithm for the Maximum Clique problem) created by Peter Kovacs
The attached patch contains the implementation of a recent heurstic …

07/05/10:

05:54 Ticket #371 (Target graph is not cleared before graph copying) closed by Peter Kovacs
fixed

07/02/10:

21:58 Ticket #379 (Find odd cycles) created by Peter Kovacs
We could extend the functions bipartite() and …
21:31 Temak edited by Peter Kovacs
(diff)
21:24 Tranzitív lezárt created by Peter Kovacs
21:09 Ticket #378 (Transitive closure) created by Peter Kovacs
It would be nice to have a tool that generates the transitive closure …
20:39 Ticket #377 (Smaller version of StaticDigraph) created by Peter Kovacs
The current implementation of StaticDigraph stores 2n+4m int …
18:49 Temak edited by Peter Kovacs
(diff)
18:49 Különböző gráfformátumok kezelése edited by Peter Kovacs
(diff)
18:48 Különböző gráfformátumok kezelése edited by Peter Kovacs
Name changed from Gráfformátumok kezelése to Különböző gráfformátumok … (diff)
18:46 Különböző gráfformátumok kezelése created by Peter Kovacs
18:14 Temak edited by Peter Kovacs
(diff)
18:12 Heurisztikus útvonalkeresés edited by Peter Kovacs
(diff)
18:09 Heurisztikus útvonalkeresés created by Peter Kovacs
18:02 pyLemon modul fejlesztése edited by Peter Kovacs
(diff)
17:41 Metaheurisztikák implementálása edited by Peter Kovacs
(diff)
17:40 Utazóügynök feladat edited by Peter Kovacs
(diff)
17:33 Bináris formátum gráfok tárolására edited by Peter Kovacs
(diff)
17:28 Ticket #376 (A star (A*) algorithm) created by Peter Kovacs
It would be nice to have an A-star (A*) algorithm implementation in …

07/01/10:

05:15 Ticket #375 (Both lower and upper supply bounds in Network simplex) created by Alpar Juttner
The idea is to extend Network Simplex so that the form of the problems …

06/30/10:

12:51 MailingLists edited by Peter Kovacs
(diff)
12:50 LocalSite edited by Peter Kovacs
(diff)
12:49 Development edited by Peter Kovacs
(diff)
12:47 LemonRepos edited by Peter Kovacs
(diff)
11:17 IssueTracker edited by Peter Kovacs
(diff)

06/29/10:

17:09 IssueTracker edited by Peter Kovacs
(diff)
14:17 Ticket #374 (Functions for weakly connected components) created by Peter Kovacs
I suggest to have the following functions: […] which would work the …
14:06 Ticket #373 (Compile time assertion) created by Peter Kovacs
Compile time assertion would be useful in some cases (instead of …
12:57 IssueTracker edited by Peter Kovacs
(diff)
12:27 IssueTracker edited by Peter Kovacs
(diff)

06/28/10:

19:24 WikiStart edited by Peter Kovacs
(diff)
19:22 ContribProjects edited by Peter Kovacs
(diff)
19:16 LocalSite edited by Peter Kovacs
(diff)
19:14 Citations edited by Peter Kovacs
(diff)
19:11 WikiStart edited by Peter Kovacs
(diff)
19:05 WikiStart edited by Peter Kovacs
(diff)
19:00 ContribProjects edited by Peter Kovacs
(diff)

06/25/10:

04:54 Ticket #372 (Critical bug in Elevator) closed by Alpar Juttner
fixed: Replying to deba: > I have uploaded the patch …

06/23/10:

21:28 Ticket #372 (Critical bug in Elevator) created by Peter Kovacs
The attached code fails on the attached input file. It runs Preflow

06/22/10:

13:16 Ticket #371 (Target graph is not cleared before graph copying) created by Peter Kovacs
The target graph must be cleared before graph copying. The clear()
Note: See TracTimeline for information about the timeline view.