COIN-OR::LEMON - Graph Library

Timeline



08/02/10:

12:32 Temak edited by Peter Kovacs
(diff)
12:31 Negatív körök keresése created by Peter Kovacs
11:50 Stabil házasítás created by Peter Kovacs
11:39 Gráfizomorfizmus, részgráfizomorfizmus created by Peter Kovacs

07/31/10:

21:33 Ticket #385 (QuadHeap instead of BinHeap in Dijkstra) created by Peter Kovacs
It is questionable whether Dijkstra should use QuadHeap instead of …
21:12 Ticket #384 (Adaptor class for complementary graph) created by Peter Kovacs
It would be nice to have an adaptor class to obtain the complementary …
19:32 Ticket #383 (List of important tasks in the documentation) created by Peter Kovacs
What about adding a page to the library doc that contains a short list …

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 …
Note: See TracTimeline for information about the timeline view.