Index: adaptors.dox
===================================================================
 adaptors.dox (revision 29)
+++ adaptors.dox (revision 32)
@@ 3,5 +3,5 @@
* This file is a part of LEMON, a generic C++ optimization library.
*
 * Copyright (C) 20032009
+ * Copyright (C) 20032010
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
@@ 119,5 +119,5 @@
maps of the original graph can be used in connection with the adaptor,
since the node and arc types of the adaptors convert to the original
item types.
+item types.
\code
@@ 132,5 +132,5 @@
instance, \ref SplitNodes, which can be used for splitting each node in
a directed graph and \ref ResidualDigraph for modeling the residual
network for flow and matching problems.
+network for flow and matching problems.
Therefore, in cases when rather complex algorithms have to be used
Index: basics.dox
===================================================================
 basics.dox (revision 28)
+++ basics.dox (revision 32)
@@ 3,5 +3,5 @@
* This file is a part of LEMON, a generic C++ optimization library.
*
 * Copyright (C) 20032009
+ * Copyright (C) 20032010
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
@@ 125,7 +125,7 @@
\note Contrary to the iterators in the C++ Standard Template Library (STL),
LEMON iterators are convertible to the corresponding
item types without having to use \c %operator*(). This is not confusing, since the
program context always indicates whether we refer to the iterator or to the graph
item (they do not have conflicting functionalities).
+item types without having to use \c %operator*(). This is not confusing,
+since the program context always indicates whether we refer to the iterator
+or to the graph item (they do not have conflicting functionalities).
The graph items are also ordered by the 'less than' operator (with respect to
@@ 155,5 +155,5 @@
Finally, you can also list the arcs starting from or arriving at a
certain node with
+certain node with
\ref concepts::Digraph::OutArcIt "ListDigraph::OutArcIt"
and
Index: getting_started.dox
===================================================================
 getting_started.dox (revision 26)
+++ getting_started.dox (revision 32)
@@ 3,5 +3,5 @@
* This file is a part of LEMON, a generic C++ optimization library.
*
 * Copyright (C) 20032009
+ * Copyright (C) 20032010
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
Index: graphs.dox
===================================================================
 graphs.dox (revision 28)
+++ graphs.dox (revision 32)
@@ 3,5 +3,5 @@
* This file is a part of LEMON, a generic C++ optimization library.
*
 * Copyright (C) 20032009
+ * Copyright (C) 20032010
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
@@ 39,5 +39,5 @@
In LEMON, there are various graph types, which are rather different, but
they all conform to the corresponding \ref graph_concepts "graph concept",
which defines the common part of the graph interfaces.
+which defines the common part of the graph interfaces.
The \ref concepts::Digraph "Digraph concept" describes the common interface
of directed graphs (without any sensible implementation), while
@@ 51,5 +51,5 @@
along with some useful basic functions for obtaining the identifiers of
the items, the end nodes of the arcs (or edges) and their iterators,
etc.
+etc.
An actual graph implementation may have various additional functionalities
according to its purpose.
@@ 67,5 +67,5 @@
significantly more efficient (both in terms of space and time), but it
provides less functionality. For example, nodes and arcs cannot be
removed from it.
+removed from it.
\ref FullDigraph is an efficient implementation of a directed full graph.
@@ 82,5 +82,5 @@
The \ref concepts::Graph "undirected graphs" also fulfill the concept of
\ref concepts::Digraph "directed graphs", in such a way that each
+\ref concepts::Digraph "directed graphs", in such a way that each
undirected \e edge of a graph can also be regarded as two oppositely
directed \e arcs. As a result, all directed graph algorithms automatically
@@ 99,5 +99,5 @@
\code
ListGraph g;

+
ListGraph::Node a = g.addNode();
ListGraph::Node b = g.addNode();
@@ 134,5 +134,5 @@
std::cout << "Edge " << g.id(e) << " connects node "
<< g.id(g.u(e)) << " and node " << g.id(g.v(e)) << std::endl;

+
std::cout << "Arc " << g.id(a2) << " goes from node "
<< g.id(g.source(a2)) << " to node " << g.id(g.target(a2)) << std::endl;
@@ 184,5 +184,5 @@
std::cout << arc_cost[a1] << ", " << arc_cost[a2] << std::endl;
\endcode

+
[SEC]sec_special_graphs[SEC] Special Graph Structures
Index: intro.dox
===================================================================
 intro.dox (revision 26)
+++ intro.dox (revision 32)
@@ 3,5 +3,5 @@
* This file is a part of LEMON, a generic C++ optimization library.
*
 * Copyright (C) 20032009
+ * Copyright (C) 20032010
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
@@ 26,5 +26,5 @@
efficient implementations of common data structures and algorithms with
focus on combinatorial optimization tasks connected mainly with graphs
and networks.
+and networks.
LEMON is an open source
Index: lgf.dox
===================================================================
 lgf.dox (revision 31)
+++ lgf.dox (revision 32)
@@ 3,5 +3,5 @@
* This file is a part of LEMON, a generic C++ optimization library.
*
 * Copyright (C) 20032008
+ * Copyright (C) 20032010
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
Index: license.dox
===================================================================
 license.dox (revision 26)
+++ license.dox (revision 32)
@@ 3,5 +3,5 @@
* This file is a part of LEMON, a generic C++ optimization library.
*
 * Copyright (C) 20032009
+ * Copyright (C) 20032010
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
Index: lp.dox
===================================================================
 lp.dox (revision 30)
+++ lp.dox (revision 32)
@@ 3,5 +3,5 @@
* This file is a part of LEMON, a generic C++ optimization library.
*
 * Copyright (C) 20032009
+ * Copyright (C) 20032010
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
Index: mainpage.dox
===================================================================
 mainpage.dox (revision 26)
+++ mainpage.dox (revision 32)
@@ 3,5 +3,5 @@
* This file is a part of LEMON, a generic C++ optimization library.
*
 * Copyright (C) 20032009
+ * Copyright (C) 20032010
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
Index: tools.dox
===================================================================
 tools.dox (revision 31)
+++ tools.dox (revision 32)
@@ 3,5 +3,5 @@
* This file is a part of LEMON, a generic C++ optimization library.
*
 * Copyright (C) 20032009
+ * Copyright (C) 20032010
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
@@ 46,5 +46,5 @@
of LEMON's approach to implement named parameters. Later it
has been evolved into a versatile tool featuring above 35 named
parameters. The following code demonstrates its typical use.
+parameters. The following code demonstrates its typical use.
\code