Graph Algorithms


Detailed Description

This group describes the several graph algorithms implemented in LEMON.


Files

file  max_matching.h
 Maximum matching algorithm.

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.
 Minimum Cost Spanning Tree Algorithms
 This group containes the algorithms for finding a minimum cost spanning tree in a graph.

Classes

class  MaxMatching
 Edmonds' alternating forest maximum matching algorithm. More...


Generated on Fri Feb 3 18:40:00 2006 for LEMON by  doxygen 1.4.6