Graph Algorithms

LEDA offers a wide variety of graph algorithms.

Graphs are a pervasive data structure and algorithms for working with them are fundamental.

The graph algorithms of LEDA can be divided into the following groups:

• Basic Graph Algorithms
• Shortest Path Algorithms
• Maximum Flow Algorithms
• Minimum Cut Algorithms
• Minimum Cost Flow Algorithms
• Matching Algorithms
• Spanning Trees and Minimum Spanning Trees

• Algorithms for Planar Graphs

• Algorithms for Drawing Graphs

See also:

Graphs and Related Data Types

GraphWin for visualizing graphs and graph algorithms

Graphs

Parameterized Graphs

Manual Page Graph Algorithms