= LEMON Contributions = == Contribution Projects == These projects are unofficial contributions for LEMON. Most of them are unmaintained. - [http://lime.cs.elte.hu/~kpeter/hg/lemon-benchmark/ LEMON Benchmark Programs] Various benchmark programs and results for LEMON 1.x.[[BR]] '''Note:''' a new [http://lemon.cs.elte.hu/hg/lemon-benchmark/ benchmark framework] is also proposed, see #33. - [http://lime.cs.elte.hu/~kpeter/hg/lemon-astar/ Heuristic shortest path algorithms for LEMON] Bidirectional Dijkstra, A*, and bidirectional A* algorithms for LEMON (by Tamas Bibok). - [http://lime.cs.elte.hu/~kpeter/hg/lemon-search-trees/ LEMON Search Trees] AVL and Red-Black Tree implementations for LEMON (by Zsolt Dollenstein). - [http://lime.cs.elte.hu/~kpeter/hg/hgwebdir.cgi/lemon-generators/ Random Graph Generators] Simple random graph generators for LEMON. - [http://lime.cs.elte.hu/~kpeter/hg/lemon-unsplittable/ Unsplittable Flow Algorithms] Unsplittable Multicommodity Flow Algorithms for LEMON 0.x (by Zoltan Bojas). - [http://lime.cs.elte.hu/~deba/open/hgwebdir.cgi/klemon/ KDE Graph Widget and Application] KDE Graph Widget and Application for LEMON 1.x. - [http://lemon.cs.elte.hu/svn/perl-lemon/ Perl-Lemon] A [http://www.perl.org/ Perl] language binding for LEMON 0.x. - [http://lemon.cs.elte.hu/svn/LemonRouting/ LemonRouting] Routing algorithms in telecommunication networks based on LEMON 0.x. - [[Satsuma]] A graph library for C#, inspired by LEMON. == Other Contributions == The following tickets contain implementations of various extensions for LEMON, which have not been merged to the main development branch yet. - [#363 #363 Planar graph type] - [#225 #225 Binary graph file format] - [#355 #355 SCIP MipSolver backend] - [#224 #224 Static graph maps] - [#370 #370 Edge coloring algorithms]