COIN-OR::LEMON - Graph Library

Changes between Initial Version and Version 1 of DevelopmentPlans


Ignore:
Timestamp:
09/12/10 10:43:34 (12 years ago)
Author:
Peter Kovacs
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • DevelopmentPlans

    v1 v1  
     1= Development Plans =
     2
     3This page contains a collection of the major goals and tasks of developing LEMON. This list is not intended to be exhaustive.
     4
     5== Port from the 0.x series of LEMON ==
     6
     7  - Bipartite graph structures (#69)
     8  - Bipartite matching algorithms (#168)
     9  - Floyd-Warshall and Johnson algorithms (#346)
     10  - Prim algorithm (#59)
     11  - Fredman-Tarjan algorithm (#59)
     12  - Edmonds-Karp algorithm (#177)
     13  - Constrained shortest path algorithm (#64)
     14  - Nagamochi-Ibaraki algorithm (#56)
     15  - Steiner tree approximation algorithm (#71)
     16  - LP utilities (#351)
     17
     18== Entirely new features ==
     19 
     20  - Basic multi-threading support (#223, #224)
     21  - Algorithms for the symmetric TSP problem (#386)
     22  - Binary LGF format (#225)
     23  - A planar graph structure (#363)
     24  - A-star (A*) algorithm (#376)
     25  - Transitive closure algorithm (#378)
     26  - Data structure for line graphs and product graphs (#237)
     27  - MIP solver backend for SCIP (#355)
     28  - LP/MIP solver backend for Gurobi (#367)
     29  - Support arbitrary precision integers and rationals (#343)
     30  - Multicommodity flow algorithms (#296)
     31  - Stable matching (stable marriage) algorithms
     32  - Algorithms for graph and subgraph isomorphism