source: lemon-tutorial/algorithms.dox @ 46:58557724a139

/* -*- mode: C++; indent-tabs-mode: nil; -*-
 *
 * This file is a part of LEMON, a generic C++ optimization library.
 *
 * Copyright (C) 2003-2010
 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
 * (Egervary Research Group on Combinatorial Optimization, EGRES).
 *
 * Permission to use, modify and distribute this software is granted
 * provided that this copyright notice appears in all copies. For
 * precise terms see the accompanying LICENSE file.
 *
 * This software is provided "AS IS" with no warranty of any kind,
 * express or implied, and with no claim as to its suitability for any
 * purpose.
 *
 */

namespace lemon {
/**
[PAGE]sec_algorithms[PAGE] Algorithms

\todo This page is under construction.

In addition to the graph structures, the most important parts of LEMON are
the various algorithm implementations, which can be used quite flexibly and
efficiently.

In this section, we present only some of the most fundamental algorithms.
For a complete overview, see the \ref algs module of the reference manual.

[SEC]sec_graph_search[SEC] Graph Search

See \ref Bfs, \ref Dfs and \ref graph_properties.

[SEC]sec_shortest_paths[SEC] Shortest Paths

See \ref Dijkstra and \ref BellmanFord.

[SEC]sec_max_flow[SEC] Maximum Flows

See \ref Preflow.

[TRAILER]
*/
}