COIN-OR::LEMON - Graph Library



21:09 Documentation edited by Peter Kovacs


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


23:33 Ticket #385 (QuadHeap instead of BinHeap in Dijkstra) created by Peter Kovacs
It is questionable whether Dijkstra should use QuadHeap instead of …
23: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 …
21: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 …


06:29 Changeset in lemon [999:c279b19abc62] by Peter Kovacs <kpeter@…>
Add a heuristic algorithm for the max clique problem (#380)


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


17:41 Ticket #381 (Simplified heaps without priority update) created by Peter Kovacs
The existing heap implementations in LEMON cointain an Item->int map …
16: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.