RhodeCode

This group describes the several data structures implemented in LEMON.

in conjunction with other graph representations. 

@defgroup semi_adaptors Semi-Adaptor Classes for Graphs

This group describes some graph types between real graphs and graph adaptors.

These classes wrap graphs to give new functionality as the adaptors do it. 

On the other hand they are not light-weight structures as the adaptors.

\brief Map structures implemented in LEMON.

This group describes the map structures implemented in LEMON.

LEMON provides several special purpose maps that e.g. combine

This group describes maps that are specifically designed to assign

values to the nodes and edges of graphs.

This group describes map adaptors that are used to create "implicit"

maps from other maps.

The typical usage of this classes is passing implicit maps to

function map adaptors give back temporary objects.

\brief Two dimensional data storages implemented in LEMON.

This group describes two dimensional data storages implemented in LEMON.

This group describes the path structures implemented in LEMON.

LEMON provides flexible data structures to work with paths.

All of them have similar interfaces and they can be copied easily with

assignment operators and copy constructors. This makes it easy and

\brief Auxiliary data structures implemented in LEMON.

This group describes some data structures implemented in LEMON in

\brief Common graph search algorithms.

This group describes the common graph search algorithms like 

Breadth-first search (Bfs) and Depth-first search (Dfs).

\brief Algorithms for finding shortest paths.

This group describes the algorithms for finding shortest paths in graphs.

\brief Algorithms for finding maximum flows.

The maximum flow problem is to find a flow between a single source and

a single target that is maximum. Formally, there is a \f$G=(V,A)\f$

maximum flow is the \f$f_a\f$ solution of the next optimization problem:

\f[ \sum_{v\in\delta^{-}(u)}f_{vu}=\sum_{v\in\delta^{+}(u)}f_{uv} \qquad \forall u \in V \setminus \{s,t\}\f]

LEMON contains several algorithms for solving maximum flow problems:

- \ref lemon::DinitzSleatorTarjan "Dinitz's blocking flow algorithm with dynamic trees"

In most cases the \ref lemon::Preflow "Preflow" algorithm provides the

provides functions to query the minimum cut, which is the dual linear

programming problem of the maximum flow.

\brief Algorithms for finding minimum cost flows and circulations.

\brief Algorithms for finding minimum cut in graphs.

cut is the \f$X\f$ solution of the next optimization problem:

LEMON contains several algorithms related to minimum cut problems:

- \ref lemon::HaoOrlin "Hao-Orlin algorithm" to calculate minimum cut

- \ref lemon::NagamochiIbaraki "Nagamochi-Ibaraki algorithm" to

- \ref lemon::GomoryHuTree "Gomory-Hu tree computation" to calculate all

\brief Algorithms for discovering the graph properties

This group describes the algorithms for discovering the graph properties

like connectivity, bipartiteness, euler property, simplicity etc.

\brief Algorithms for planarity checking, embedding and drawing

This group describes the algorithms for planarity checking, embedding and drawing.

\brief Algorithms for finding matchings in graphs and bipartite graphs.

This group contains algorithm objects and functions to calculate

\brief Algorithms for finding a minimum cost spanning tree in a graph.

This group describes the algorithms for finding a minimum cost spanning

\brief Auxiliary algorithms implemented in LEMON.

This group describes some algorithms implemented in LEMON

in order to make it easier to implement complex algorithms.

\brief Approximation algorithms.

This group describes the approximation and heuristic algorithms

implemented in LEMON.

\brief Helper tools to the Lp and Mip solvers.

This group describes some metaheuristic optimization tools.

\brief Tools and utilities for programming in LEMON

Tools and utilities for programming in LEMON.

\brief Simple basic graph utilities.

\brief Tools for development, debugging and testing.

This group describes several useful tools for development,

\brief Simple tools for measuring the performance of algorithms.

This group describes simple tools for measuring the performance

\brief Tools to make it easier to create graphs.

This group describes the tools that makes it easier to create graphs and

\brief Exceptions defined in LEMON.

This group describes the exceptions defined in LEMON.

\brief Graph Input-Output methods

This group describes the tools for importing and exporting graphs 

\c DIMACS format and the encapsulated postscript (EPS) format.

This group describes methods for reading and writing LEMON format. 

You can find more about this format on the \ref graph-io-page "Graph Input-Output"

This group describes section readers and writers that can be attached to

\ref LemonReader and \ref LemonWriter.

This group describes general \c EPS drawing methods and special

  that makes it possible to check whether a certain implementation of a

This group describes the skeletons and concept checking classes of LEMON's

This group describes some Experimental structures and algorithms.