= Development Plans =

This page contains a collection of the major goals and tasks of developing LEMON. This list is not intended to be exhaustive.

== Port from the 0.x series of LEMON ==

  - Bipartite graph structures (#69)
  - Bipartite matching algorithms (#168)
  - Floyd-Warshall and Johnson algorithms (#346)
  - Prim algorithm (#59)
  - Fredman-Tarjan algorithm (#59) 
  - Edmonds-Karp algorithm (#177) 
  - Constrained shortest path algorithm (#64)
  - Nagamochi-Ibaraki algorithm (#56)
  - Steiner tree approximation algorithm (#71)
  - LP utilities (#351)

== Entirely new features ==
  
  - Basic multi-threading support (#223, #224)
  - Algorithms for the symmetric TSP problem (#386)
  - Binary LGF format (#225)
  - A planar graph structure (#363)
  - A-star (A*) algorithm (#376)
  - Transitive closure algorithm (#378)
  - Data structure for line graphs and product graphs (#237)
  - MIP solver backend for SCIP (#355)
  - LP/MIP solver backend for Gurobi (#367)
  - Support arbitrary precision integers and rationals (#343)
  - Multicommodity flow algorithms (#296)
  - Stable matching (stable marriage) algorithms
  - Algorithms for graph and subgraph isomorphism