1 /* -*- mode: C++; indent-tabs-mode: nil; -*-
3 * This file is a part of LEMON, a generic C++ optimization library.
5 * Copyright (C) 2003-2010
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7 * (Egervary Research Group on Combinatorial Optimization, EGRES).
9 * Permission to use, modify and distribute this software is granted
10 * provided that this copyright notice appears in all copies. For
11 * precise terms see the accompanying LICENSE file.
13 * This software is provided "AS IS" with no warranty of any kind,
14 * express or implied, and with no claim as to its suitability for any
21 [PAGE]sec_algorithms[PAGE] Algorithms
23 \todo This page is under construction.
25 In addition to the graph structures, the most important parts of LEMON are
26 the various algorithm implementations, which can be used quite flexibly and
29 In this section, we present only some of the most fundamental algorithms.
30 For a complete overview, see the \ref algs module of the reference manual.
32 [SEC]sec_graph_search[SEC] Graph Search
34 See \ref Bfs, \ref Dfs and \ref graph_properties.
36 [SEC]sec_shortest_paths[SEC] Shortest Paths
38 See \ref Dijkstra and \ref BellmanFord.
40 [SEC]sec_max_flow[SEC] Maximum Flows