Index: adaptors.dox
===================================================================
--- adaptors.dox (revision 45)
+++ adaptors.dox (revision 57)
@@ -26,5 +26,5 @@
If some nodes or arcs have to be hidden (maybe temporarily) or the reverse
oriented graph has to be used, then this is the case.
-However, actually modifing physical storage of the graph or
+However, actually modifying physical storage of the graph or
making a copy of the graph structure along with the required maps
could be rather expensive (in time or in memory usage) compared to the
@@ -62,5 +62,5 @@
well tested standard components.
-For solving the problem introduced above, we could use the follwing code.
+For solving the problem introduced above, we could use the following code.
\code
Index: algorithms.dox
===================================================================
--- algorithms.dox (revision 50)
+++ algorithms.dox (revision 57)
@@ -23,7 +23,12 @@
\todo This page is under construction.
+\todo The following contents are mainly ported from the LEMON 0.x tutorial,
+thus they have to be thoroughly revised and reworked.
+
+\warning Currently, this section may contain old or faulty contents.
+
In addition to the graph structures, the most important parts of LEMON are
the various algorithms related to graph theory and combinatorial optimization.
-The library probvides quite flexible and efficient implementations
+The library provides quite flexible and efficient implementations
for well-known fundamental algorithms, such as breadth-first
search (BFS), depth-first search (DFS), Dijkstra algorithm, Kruskal algorithm
@@ -38,7 +43,4 @@
[SEC]sec_graph_search[SEC] Graph Search
-\todo The following contents are ported from the LEMON 0.x tutorial,
-thus they have to thouroughly revised, reorganized and reworked.
-
See \ref Bfs, \ref Dfs and \ref graph_properties.
@@ -51,5 +53,5 @@
The class has two template parameters: \b GR and \b TR.
GR is the digraph the algorithm runs on. It has \ref lemon::ListDigraph "ListDigraph" as default type.
-TR is a Traits class commonly used to easy the parametrization of templates. In most cases you
+TR is a Traits class commonly used to easy the parameterization of templates. In most cases you
wont need to modify the default type \ref lemon::BfsDefaultTraits "BfsDefaultTraits".
Index: getting_started.dox
===================================================================
--- getting_started.dox (revision 32)
+++ getting_started.dox (revision 57)
@@ -50,5 +50,5 @@
\endverbatim
-As a result you will get the exacutable \c hello_lemon in the current
+As a result you will get the executable \c hello_lemon in the current
directory, which you can run by the following command.
Index: intro.dox
===================================================================
--- intro.dox (revision 32)
+++ intro.dox (revision 57)
@@ -37,5 +37,5 @@
for example in telecommunication, computer networks, logistics, scheduling,
and other areas.
-A very natural way of modelling these networks is by means of a graph.
+A very natural way of modeling these networks is by means of a graph.
Generally, if you want to write any program that works with graphs,
then you might find it useful and convenient to use LEMON.
Index: lp.dox
===================================================================
--- lp.dox (revision 55)
+++ lp.dox (revision 57)
@@ -195,7 +195,7 @@
\endcode
-The documnetation of the MIP solver interface can be found in the
+The documentation of the MIP solver interface can be found in the
reference manual at the class \ref MipSolver. The common parts of the
-LP and MIP interfaces are docmented in their common ancestor class
+LP and MIP interfaces are documented in their common ancestor class
\ref LpBase.
Index: maps.dox
===================================================================
--- maps.dox (revision 49)
+++ maps.dox (revision 57)
@@ -24,5 +24,7 @@
\todo The following contents are ported from the LEMON 0.x tutorial,
-thus they have to thouroughly revised, reorganized and reworked.
+thus they have to be thoroughly revised and reworked.
+
+\warning Currently, this section may contain old or faulty contents.
The LEMON maps are not only just storage classes, but also
Index: tools.dox
===================================================================
--- tools.dox (revision 46)
+++ tools.dox (revision 57)
@@ -44,6 +44,6 @@
configurable graph displaying tool (using EPS output format).
Originally, it was developed to evaluate the flexibility and scalability
-of LEMON's approach to implement named parameters. Later it
-has been evolved into a versatile tool featuring above 35 named
+of LEMON's approach to implement \ref named-param "named parameters".
+Later it has been evolved into a versatile tool featuring above 35 named
parameters. The following code demonstrates its typical use.
@@ -68,4 +68,7 @@
\image html graph_to_eps.png
+For more examples, see \ref graph_to_eps_demo.cc in the demo directory
+of the LEMON source.
+
[SEC]sec_time_count[SEC] Time Measuring and Counting
Index: undir_graphs.dox
===================================================================
--- undir_graphs.dox (revision 50)
+++ undir_graphs.dox (revision 57)
@@ -56,5 +56,5 @@
Each edge has an inherent orientation, thus it can be defined whether
an arc is forward or backward oriented in an undirected graph with respect
-to this default oriantation of the represented edge.
+to this default orientation of the represented edge.
The direction of an arc can be obtained and set using the functions
\ref concepts::Graph::direction() "direction()" and
@@ -130,5 +130,5 @@
-[SEC]sec_undir_graph_algs[SEC] Undirected Graph Algorihtms
+[SEC]sec_undir_graph_algs[SEC] Undirected Graph Algorithms
\todo This subsection is under construction.