1.1 --- a/algorithms.dox Mon Mar 01 02:28:05 2010 +0100
1.2 +++ b/algorithms.dox Mon Mar 01 02:28:44 2010 +0100
1.3 @@ -22,9 +22,14 @@
1.4
1.5 \todo This page is under construction.
1.6
1.7 +\todo The following contents are mainly ported from the LEMON 0.x tutorial,
1.8 +thus they have to be thoroughly revised and reworked.
1.9 +
1.10 +\warning Currently, this section may contain old or faulty contents.
1.11 +
1.12 In addition to the graph structures, the most important parts of LEMON are
1.13 the various algorithms related to graph theory and combinatorial optimization.
1.14 -The library probvides quite flexible and efficient implementations
1.15 +The library provides quite flexible and efficient implementations
1.16 for well-known fundamental algorithms, such as breadth-first
1.17 search (BFS), depth-first search (DFS), Dijkstra algorithm, Kruskal algorithm
1.18 and methods for discovering graph properties like connectivity, bipartiteness
1.19 @@ -37,9 +42,6 @@
1.20
1.21 [SEC]sec_graph_search[SEC] Graph Search
1.22
1.23 -\todo The following contents are ported from the LEMON 0.x tutorial,
1.24 -thus they have to thouroughly revised, reorganized and reworked.
1.25 -
1.26 See \ref Bfs, \ref Dfs and \ref graph_properties.
1.27
1.28 Both \ref lemon::Bfs "Bfs" and \ref lemon::Dfs "Dfs" are highly adaptable and efficient
1.29 @@ -50,7 +52,7 @@
1.30 The algorithm is implemented in the \ref lemon::Bfs "Bfs" template class - rather than as function.
1.31 The class has two template parameters: \b GR and \b TR.<br>
1.32 GR is the digraph the algorithm runs on. It has \ref lemon::ListDigraph "ListDigraph" as default type.
1.33 -TR is a Traits class commonly used to easy the parametrization of templates. In most cases you
1.34 +TR is a Traits class commonly used to easy the parameterization of templates. In most cases you
1.35 wont need to modify the default type \ref lemon::BfsDefaultTraits "BfsDefaultTraits<GR>".
1.36
1.37 To use the class, declare it!