Algorithms
The same group on the Doxygen site.
- group Algorithms
This group contains the several algorithms implemented in LEMON.
Subgroups
Group |
Description |
|---|---|
Common graph search algorithms. |
|
Algorithms for finding shortest paths. |
|
Algorithms for finding minimum cost spanning trees and arborescences. |
|
Algorithms for finding maximum flows. |
|
Algorithms for finding minimum cost flows and circulations. |
|
Algorithms for finding minimum cut in graphs. |
|
Algorithms for finding minimum mean cycles. |
|
Algorithms for finding matchings in graphs and bipartite graphs. |
|
Algorithms for discovering the graph properties. |
|
Algorithms for testing (sub)graph isomorphism. |
|
Algorithms for planarity checking, embedding and drawing. |
|
Algorithms for the symmetric traveling salesman problem. |
|
Approximation algorithms. |
|
Auxiliary algorithms implemented in LEMON. |