1.1 --- a/adaptors.dox Mon Feb 15 01:47:33 2010 +0100
1.2 +++ b/adaptors.dox Mon Feb 15 01:51:58 2010 +0100
1.3 @@ -2,7 +2,7 @@
1.4 *
1.5 * This file is a part of LEMON, a generic C++ optimization library.
1.6 *
1.7 - * Copyright (C) 2003-2009
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 @@ -118,7 +118,7 @@
1.13 to run Dijksta's algorithm on the reverse oriented graph. Note that the
1.14 maps of the original graph can be used in connection with the adaptor,
1.15 since the node and arc types of the adaptors convert to the original
1.16 -item types.
1.17 +item types.
1.18
1.19 \code
1.20 dijkstra(reverseDigraph(g), length).distMap(dist).run(s);
1.21 @@ -131,7 +131,7 @@
1.22 original iterators. LEMON also provides some more complex adaptors, for
1.23 instance, \ref SplitNodes, which can be used for splitting each node in
1.24 a directed graph and \ref ResidualDigraph for modeling the residual
1.25 -network for flow and matching problems.
1.26 +network for flow and matching problems.
1.27
1.28 Therefore, in cases when rather complex algorithms have to be used
1.29 on a subgraph (e.g. when the nodes and arcs have to be traversed several
1.30 @@ -196,4 +196,4 @@
1.31
1.32 [TRAILER]
1.33 */
1.34 -}
1.35 \ No newline at end of file
1.36 +}
2.1 --- a/basics.dox Mon Feb 15 01:47:33 2010 +0100
2.2 +++ b/basics.dox Mon Feb 15 01:51:58 2010 +0100
2.3 @@ -2,7 +2,7 @@
2.4 *
2.5 * This file is a part of LEMON, a generic C++ optimization library.
2.6 *
2.7 - * Copyright (C) 2003-2009
2.8 + * Copyright (C) 2003-2010
2.9 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
2.10 * (Egervary Research Group on Combinatorial Optimization, EGRES).
2.11 *
2.12 @@ -124,9 +124,9 @@
2.13
2.14 \note Contrary to the iterators in the C++ Standard Template Library (STL),
2.15 LEMON iterators are convertible to the corresponding
2.16 -item types without having to use \c %operator*(). This is not confusing, since the
2.17 -program context always indicates whether we refer to the iterator or to the graph
2.18 -item (they do not have conflicting functionalities).
2.19 +item types without having to use \c %operator*(). This is not confusing,
2.20 +since the program context always indicates whether we refer to the iterator
2.21 +or to the graph item (they do not have conflicting functionalities).
2.22
2.23 The graph items are also ordered by the 'less than' operator (with respect to
2.24 their integer identifiers). For example, this code will add only one of the
2.25 @@ -154,7 +154,7 @@
2.26 \endcode
2.27
2.28 Finally, you can also list the arcs starting from or arriving at a
2.29 -certain node with
2.30 +certain node with
2.31 \ref concepts::Digraph::OutArcIt "ListDigraph::OutArcIt"
2.32 and
2.33 \ref concepts::Digraph::InArcIt "ListDigraph::InArcIt".
3.1 --- a/getting_started.dox Mon Feb 15 01:47:33 2010 +0100
3.2 +++ b/getting_started.dox Mon Feb 15 01:51:58 2010 +0100
3.3 @@ -2,7 +2,7 @@
3.4 *
3.5 * This file is a part of LEMON, a generic C++ optimization library.
3.6 *
3.7 - * Copyright (C) 2003-2009
3.8 + * Copyright (C) 2003-2010
3.9 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
3.10 * (Egervary Research Group on Combinatorial Optimization, EGRES).
3.11 *
4.1 --- a/graphs.dox Mon Feb 15 01:47:33 2010 +0100
4.2 +++ b/graphs.dox Mon Feb 15 01:51:58 2010 +0100
4.3 @@ -2,7 +2,7 @@
4.4 *
4.5 * This file is a part of LEMON, a generic C++ optimization library.
4.6 *
4.7 - * Copyright (C) 2003-2009
4.8 + * Copyright (C) 2003-2010
4.9 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
4.10 * (Egervary Research Group on Combinatorial Optimization, EGRES).
4.11 *
4.12 @@ -38,7 +38,7 @@
4.13
4.14 In LEMON, there are various graph types, which are rather different, but
4.15 they all conform to the corresponding \ref graph_concepts "graph concept",
4.16 -which defines the common part of the graph interfaces.
4.17 +which defines the common part of the graph interfaces.
4.18 The \ref concepts::Digraph "Digraph concept" describes the common interface
4.19 of directed graphs (without any sensible implementation), while
4.20 the \ref concepts::Graph "Graph concept" describes the undirected graphs.
4.21 @@ -50,7 +50,7 @@
4.22 The graph %concepts define the member classes for the iterators and maps
4.23 along with some useful basic functions for obtaining the identifiers of
4.24 the items, the end nodes of the arcs (or edges) and their iterators,
4.25 -etc.
4.26 +etc.
4.27 An actual graph implementation may have various additional functionalities
4.28 according to its purpose.
4.29
4.30 @@ -66,7 +66,7 @@
4.31 \ref SmartDigraph is another general digraph implementation, which is
4.32 significantly more efficient (both in terms of space and time), but it
4.33 provides less functionality. For example, nodes and arcs cannot be
4.34 -removed from it.
4.35 +removed from it.
4.36
4.37 \ref FullDigraph is an efficient implementation of a directed full graph.
4.38 This structure is completely static, so you can neither add nor delete
4.39 @@ -81,7 +81,7 @@
4.40 They provide similar features to the digraph structures.
4.41
4.42 The \ref concepts::Graph "undirected graphs" also fulfill the concept of
4.43 -\ref concepts::Digraph "directed graphs", in such a way that each
4.44 +\ref concepts::Digraph "directed graphs", in such a way that each
4.45 undirected \e edge of a graph can also be regarded as two oppositely
4.46 directed \e arcs. As a result, all directed graph algorithms automatically
4.47 run on undirected graphs, as well.
4.48 @@ -98,7 +98,7 @@
4.49 For example,
4.50 \code
4.51 ListGraph g;
4.52 -
4.53 +
4.54 ListGraph::Node a = g.addNode();
4.55 ListGraph::Node b = g.addNode();
4.56 ListGraph::Node c = g.addNode();
4.57 @@ -133,7 +133,7 @@
4.58 \code
4.59 std::cout << "Edge " << g.id(e) << " connects node "
4.60 << g.id(g.u(e)) << " and node " << g.id(g.v(e)) << std::endl;
4.61 -
4.62 +
4.63 std::cout << "Arc " << g.id(a2) << " goes from node "
4.64 << g.id(g.source(a2)) << " to node " << g.id(g.target(a2)) << std::endl;
4.65 \endcode
4.66 @@ -183,7 +183,7 @@
4.67 // std::cout << arc_cost[e] << std::endl; // this is not valid
4.68 std::cout << arc_cost[a1] << ", " << arc_cost[a2] << std::endl;
4.69 \endcode
4.70 -
4.71 +
4.72 [SEC]sec_special_graphs[SEC] Special Graph Structures
4.73
4.74 In addition to the general undirected classes \ref ListGraph and
5.1 --- a/intro.dox Mon Feb 15 01:47:33 2010 +0100
5.2 +++ b/intro.dox Mon Feb 15 01:51:58 2010 +0100
5.3 @@ -2,7 +2,7 @@
5.4 *
5.5 * This file is a part of LEMON, a generic C++ optimization library.
5.6 *
5.7 - * Copyright (C) 2003-2009
5.8 + * Copyright (C) 2003-2010
5.9 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
5.10 * (Egervary Research Group on Combinatorial Optimization, EGRES).
5.11 *
5.12 @@ -25,7 +25,7 @@
5.13 <b>O</b>ptimization in <b>N</b>etworks. It is a C++ template library providing
5.14 efficient implementations of common data structures and algorithms with
5.15 focus on combinatorial optimization tasks connected mainly with graphs
5.16 -and networks.
5.17 +and networks.
5.18
5.19 <b>LEMON is an <a class="el" href="http://opensource.org/">open source</a>
5.20 project.
6.1 --- a/lgf.dox Mon Feb 15 01:47:33 2010 +0100
6.2 +++ b/lgf.dox Mon Feb 15 01:51:58 2010 +0100
6.3 @@ -2,7 +2,7 @@
6.4 *
6.5 * This file is a part of LEMON, a generic C++ optimization library.
6.6 *
6.7 - * Copyright (C) 2003-2008
6.8 + * Copyright (C) 2003-2010
6.9 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
6.10 * (Egervary Research Group on Combinatorial Optimization, EGRES).
6.11 *
7.1 --- a/license.dox Mon Feb 15 01:47:33 2010 +0100
7.2 +++ b/license.dox Mon Feb 15 01:51:58 2010 +0100
7.3 @@ -2,7 +2,7 @@
7.4 *
7.5 * This file is a part of LEMON, a generic C++ optimization library.
7.6 *
7.7 - * Copyright (C) 2003-2009
7.8 + * Copyright (C) 2003-2010
7.9 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7.10 * (Egervary Research Group on Combinatorial Optimization, EGRES).
7.11 *
8.1 --- a/lp.dox Mon Feb 15 01:47:33 2010 +0100
8.2 +++ b/lp.dox Mon Feb 15 01:51:58 2010 +0100
8.3 @@ -2,7 +2,7 @@
8.4 *
8.5 * This file is a part of LEMON, a generic C++ optimization library.
8.6 *
8.7 - * Copyright (C) 2003-2009
8.8 + * Copyright (C) 2003-2010
8.9 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
8.10 * (Egervary Research Group on Combinatorial Optimization, EGRES).
8.11 *
8.12 @@ -100,4 +100,4 @@
8.13
8.14 [TRAILER]
8.15 */
8.16 -}
8.17 \ No newline at end of file
8.18 +}
9.1 --- a/mainpage.dox Mon Feb 15 01:47:33 2010 +0100
9.2 +++ b/mainpage.dox Mon Feb 15 01:51:58 2010 +0100
9.3 @@ -2,7 +2,7 @@
9.4 *
9.5 * This file is a part of LEMON, a generic C++ optimization library.
9.6 *
9.7 - * Copyright (C) 2003-2009
9.8 + * Copyright (C) 2003-2010
9.9 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
9.10 * (Egervary Research Group on Combinatorial Optimization, EGRES).
9.11 *
10.1 --- a/tools.dox Mon Feb 15 01:47:33 2010 +0100
10.2 +++ b/tools.dox Mon Feb 15 01:51:58 2010 +0100
10.3 @@ -2,7 +2,7 @@
10.4 *
10.5 * This file is a part of LEMON, a generic C++ optimization library.
10.6 *
10.7 - * Copyright (C) 2003-2009
10.8 + * Copyright (C) 2003-2010
10.9 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
10.10 * (Egervary Research Group on Combinatorial Optimization, EGRES).
10.11 *
10.12 @@ -45,7 +45,7 @@
10.13 Originally, it was developed to evaluate the flexibility and scalability
10.14 of LEMON's approach to implement named parameters. Later it
10.15 has been evolved into a versatile tool featuring above 35 named
10.16 -parameters. The following code demonstrates its typical use.
10.17 +parameters. The following code demonstrates its typical use.
10.18
10.19 \code
10.20 graphToEps(g, "graph.eps")