| 5.3. Built-in graph algorithms | ||
|---|---|---|
 | Chapter 5. Graphs and graph algorithms |  |
| 5.3. Built-in graph algorithms | ||
|---|---|---|
| | Chapter 5. Graphs and graph algorithms | |
With graph LEDA offers a very
powerful class for coding and processing graphs. It is
understood that LEDA in addition provides the most important
graph algorithms, which all work on the class
graph.
This section addresses these built-in algorithms. It divides them into several groups according to their functionality and describes one or more main representative of each group.
| |  | |
| 5.2.7. Special auxiliary data structures for graph algorithms |  | 5.3.1. Algorithms for basic properties |