COIN-OR::LEMON - Graph Library

Changes between Version 10 and Version 11 of ContribProjects


Ignore:
Timestamp:
12/03/13 22:01:03 (8 years ago)
Author:
Peter Kovacs
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • ContribProjects

    v10 v11  
    44
    55 - [http://lime.cs.elte.hu/~kpeter/hg/lemon-benchmark/ LEMON Benchmark Programs]
    6      Various benchmark programs and results for LEMON 1.x.
     6     Various benchmark programs and results for LEMON 1.x.[[BR]]
     7     '''Note:''' a new [http://lemon.cs.elte.hu/hg/lemon-benchmark/ benchmark framework] is also proposed, see #33.
     8
     9 - [http://lime.cs.elte.hu/~kpeter/hg/lemon-astar/ Heuristic shortest path algorithms for LEMON]
     10     Bidirectional Dijkstra, A*, and bidirectional A* algorithms for LEMON (by Tamas Bibok).
    711
    812 - [http://lime.cs.elte.hu/~kpeter/hg/lemon-search-trees/ LEMON Search Trees]
     
    1519     KDE Graph Widget and Application for LEMON 1.x.
    1620
    17  - [http://lime.cs.elte.hu/~gyorokp/hg/sikgraf/ Planar graph type for LEMON]
    18      Planar graph type for LEMON (prototype).
    19 
    2021 - [http://lemon.cs.elte.hu/svn/perl-lemon/ Perl-Lemon]
    2122     A [http://www.perl.org/ Perl] language binding for LEMON 0.x.
     
    2425     Routing algorithms in telecommunication networks based on LEMON 0.x.
    2526
    26  - [[Satsuma]]: a graph library for C#, inspired by LEMON.
     27 - [[Satsuma]]
     28     A graph library for C#, inspired by LEMON.