1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/algorithms.dox	Mon Feb 22 00:46:59 2010 +0100
     1.3 @@ -0,0 +1,46 @@
     1.4 +/* -*- mode: C++; indent-tabs-mode: nil; -*-
     1.5 + *
     1.6 + * This file is a part of LEMON, a generic C++ optimization library.
     1.7 + *
     1.8 + * Copyright (C) 2003-2010
     1.9 + * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.10 + * (Egervary Research Group on Combinatorial Optimization, EGRES).
    1.11 + *
    1.12 + * Permission to use, modify and distribute this software is granted
    1.13 + * provided that this copyright notice appears in all copies. For
    1.14 + * precise terms see the accompanying LICENSE file.
    1.15 + *
    1.16 + * This software is provided "AS IS" with no warranty of any kind,
    1.17 + * express or implied, and with no claim as to its suitability for any
    1.18 + * purpose.
    1.19 + *
    1.20 + */
    1.21 +
    1.22 +namespace lemon {
    1.23 +/**
    1.24 +[PAGE]sec_algorithms[PAGE] Algorithms
    1.25 +
    1.26 +\todo This page is under construction.
    1.27 +
    1.28 +In addition to the graph structures, the most important parts of LEMON are
    1.29 +the various algorithm implementations, which can be used quite flexibly and
    1.30 +efficiently.
    1.31 +
    1.32 +In this section, we present only some of the most fundamental algorithms.
    1.33 +For a complete overview, see the \ref algs module of the reference manual.
    1.34 +
    1.35 +[SEC]sec_graph_search[SEC] Graph Search
    1.36 +
    1.37 +See \ref Bfs, \ref Dfs and \ref graph_properties.
    1.38 +
    1.39 +[SEC]sec_shortest_paths[SEC] Shortest Paths
    1.40 +
    1.41 +See \ref Dijkstra and \ref BellmanFord.
    1.42 +
    1.43 +[SEC]sec_max_flow[SEC] Maximum Flows
    1.44 +
    1.45 +See \ref Preflow.
    1.46 +
    1.47 +[TRAILER]
    1.48 +*/
    1.49 +}