Changes between Version 1 and Version 2 of DevelopmentPlans

Timestamp:

03/10/17 22:56:24 (8 years ago)

Author:

Peter Kovacs

Comment:

Update page: remove plans that are already done.

DevelopmentPlans

@@ -5 +5 @@
 == 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)
@@ -19 +16 @@
   
   - Basic multi-threading support (#223, #224)
-  - Algorithms for the symmetric TSP problem (#386)
   - Binary LGF format (#225)
   - A planar graph structure (#363)