Algorithms


Detailed Description

This group describes the several algorithms implemented in LEMON.


Modules

 General Graph Utilities
 This group describes some simple general graph utilities.
 Path and Flow Algorithms
 This group describes the algorithms for finding paths and flows in graphs.
 Topology related algorithms
 This group describes the algorithms for discover the topology of the graphs.
 Matching algorithms in graphs and bipartite graphs
 This group describes the algorithms for find matchings in graphs and bipartite graphs.
 Minimum Cost Spanning Tree Algorithms
 This group contains the algorithms for finding a minimum cost spanning tree in a graph.
 Auxiliary Algorithms
 Some algorithms implemented in LEMON.


Generated on Tue Oct 31 09:49:38 2006 for LEMON by  doxygen 1.5.1