COIN-OR::LEMON - Graph Library

Changes between Version 1 and Version 2 of DevelopmentPlans


Ignore:
Timestamp:
03/10/17 23:56:24 (3 years ago)
Author:
Peter Kovacs
Comment:

Update page: remove plans that are already done.

Legend:

Unmodified
Added
Removed
Modified
  • DevelopmentPlans

    v1 v2  
    55== Port from the 0.x series of LEMON ==
    66
    7   - Bipartite graph structures (#69)
    87  - Bipartite matching algorithms (#168)
    98  - Floyd-Warshall and Johnson algorithms (#346)
    109  - Prim algorithm (#59)
    1110  - Fredman-Tarjan algorithm (#59)
    12   - Edmonds-Karp algorithm (#177)
    1311  - Constrained shortest path algorithm (#64)
    14   - Nagamochi-Ibaraki algorithm (#56)
    1512  - Steiner tree approximation algorithm (#71)
    1613  - LP utilities (#351)
     
    1916 
    2017  - Basic multi-threading support (#223, #224)
    21   - Algorithms for the symmetric TSP problem (#386)
    2218  - Binary LGF format (#225)
    2319  - A planar graph structure (#363)