Algorithms

The same group on the Doxygen site.

group Algorithms

This group contains the several algorithms implemented in LEMON.

Subgroups

Group

Description

Graph Search

Common graph search algorithms.

Shortest Path Algorithms

Algorithms for finding shortest paths.

Minimum Spanning Tree Algorithms

Algorithms for finding minimum cost spanning trees and arborescences.

Maximum Flow Algorithms

Algorithms for finding maximum flows.

Minimum Cost Flow Algorithms

Algorithms for finding minimum cost flows and circulations.

Minimum Cut Algorithms

Algorithms for finding minimum cut in graphs.

Minimum Mean Cycle Algorithms

Algorithms for finding minimum mean cycles.

Matching Algorithms

Algorithms for finding matchings in graphs and bipartite graphs.

Connectivity and Other Graph Properties

Algorithms for discovering the graph properties.

Graph Isomorphism

Algorithms for testing (sub)graph isomorphism.

Planar Embedding and Drawing

Algorithms for planarity checking, embedding and drawing.

Traveling Salesman Problem

Algorithms for the symmetric traveling salesman problem.

Approximation Algorithms

Approximation algorithms.

Auxiliary Algorithms

Auxiliary algorithms implemented in LEMON.