LEMON Contributions

Contribution Projects

These projects are unofficial contributions for LEMON. Most of them are unmaintained.

• ​LEMON Benchmark Programs

Various benchmark programs and results for LEMON 1.x.
Note: a new benchmark framework is also proposed, see #33.

• ​Heuristic shortest path algorithms for LEMON

Bidirectional Dijkstra, A*, and bidirectional A* algorithms for LEMON (by Tamas Bibok).

• ​LEMON Search Trees

AVL and Red-Black Tree implementations for LEMON (by Zsolt Dollenstein).

• ​Random Graph Generators

Simple random graph generators for LEMON.

• ​Unsplittable Flow Algorithms

Unsplittable Multicommodity Flow Algorithms for LEMON 0.x (by Zoltan Bojas).

• ​KDE Graph Widget and Application

KDE Graph Widget and Application for LEMON 1.x.

• Perl-Lemon

A ​Perl language binding for LEMON 0.x.

• 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 Planar graph type
• #225 Binary graph file format
• #355 SCIP MipSolver backend
• #224 Static graph maps
• #370 Edge coloring algorithms