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