# HG changeset patch # User Peter Kovacs # Date 1266195118 -3600 # Node ID ef12f83752f601d062a4fc24e748a83a473d87ab # Parent 02083323ff2c489e6bde4f7a81e4092bccabf21d Happy New Year + unify files diff -r 02083323ff2c -r ef12f83752f6 adaptors.dox --- a/adaptors.dox Mon Feb 15 01:47:33 2010 +0100 +++ b/adaptors.dox Mon Feb 15 01:51:58 2010 +0100 @@ -2,7 +2,7 @@ * * This file is a part of LEMON, a generic C++ optimization library. * - * Copyright (C) 2003-2009 + * Copyright (C) 2003-2010 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport * (Egervary Research Group on Combinatorial Optimization, EGRES). * @@ -118,7 +118,7 @@ to run Dijksta's algorithm on the reverse oriented graph. Note that the 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 dijkstra(reverseDigraph(g), length).distMap(dist).run(s); @@ -131,7 +131,7 @@ original iterators. LEMON also provides some more complex adaptors, for 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 on a subgraph (e.g. when the nodes and arcs have to be traversed several @@ -196,4 +196,4 @@ [TRAILER] */ -} \ No newline at end of file +} diff -r 02083323ff2c -r ef12f83752f6 basics.dox --- a/basics.dox Mon Feb 15 01:47:33 2010 +0100 +++ b/basics.dox Mon Feb 15 01:51:58 2010 +0100 @@ -2,7 +2,7 @@ * * This file is a part of LEMON, a generic C++ optimization library. * - * Copyright (C) 2003-2009 + * Copyright (C) 2003-2010 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport * (Egervary Research Group on Combinatorial Optimization, EGRES). * @@ -124,9 +124,9 @@ \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 their integer identifiers). For example, this code will add only one of the @@ -154,7 +154,7 @@ \endcode 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 \ref concepts::Digraph::InArcIt "ListDigraph::InArcIt". diff -r 02083323ff2c -r ef12f83752f6 getting_started.dox --- a/getting_started.dox Mon Feb 15 01:47:33 2010 +0100 +++ b/getting_started.dox Mon Feb 15 01:51:58 2010 +0100 @@ -2,7 +2,7 @@ * * This file is a part of LEMON, a generic C++ optimization library. * - * Copyright (C) 2003-2009 + * Copyright (C) 2003-2010 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport * (Egervary Research Group on Combinatorial Optimization, EGRES). * diff -r 02083323ff2c -r ef12f83752f6 graphs.dox --- a/graphs.dox Mon Feb 15 01:47:33 2010 +0100 +++ b/graphs.dox Mon Feb 15 01:51:58 2010 +0100 @@ -2,7 +2,7 @@ * * This file is a part of LEMON, a generic C++ optimization library. * - * Copyright (C) 2003-2009 + * Copyright (C) 2003-2010 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport * (Egervary Research Group on Combinatorial Optimization, EGRES). * @@ -38,7 +38,7 @@ 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 the \ref concepts::Graph "Graph concept" describes the undirected graphs. @@ -50,7 +50,7 @@ The graph %concepts define the member classes for the iterators and maps 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. @@ -66,7 +66,7 @@ \ref SmartDigraph is another general digraph implementation, which is 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. This structure is completely static, so you can neither add nor delete @@ -81,7 +81,7 @@ They provide similar features to the digraph structures. 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 run on undirected graphs, as well. @@ -98,7 +98,7 @@ For example, \code ListGraph g; - + ListGraph::Node a = g.addNode(); ListGraph::Node b = g.addNode(); ListGraph::Node c = g.addNode(); @@ -133,7 +133,7 @@ \code 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; \endcode @@ -183,7 +183,7 @@ // std::cout << arc_cost[e] << std::endl; // this is not valid std::cout << arc_cost[a1] << ", " << arc_cost[a2] << std::endl; \endcode - + [SEC]sec_special_graphs[SEC] Special Graph Structures In addition to the general undirected classes \ref ListGraph and diff -r 02083323ff2c -r ef12f83752f6 intro.dox --- a/intro.dox Mon Feb 15 01:47:33 2010 +0100 +++ b/intro.dox Mon Feb 15 01:51:58 2010 +0100 @@ -2,7 +2,7 @@ * * This file is a part of LEMON, a generic C++ optimization library. * - * Copyright (C) 2003-2009 + * Copyright (C) 2003-2010 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport * (Egervary Research Group on Combinatorial Optimization, EGRES). * @@ -25,7 +25,7 @@ Optimization in Networks. It is a C++ template library providing 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 project. diff -r 02083323ff2c -r ef12f83752f6 lgf.dox --- a/lgf.dox Mon Feb 15 01:47:33 2010 +0100 +++ b/lgf.dox Mon Feb 15 01:51:58 2010 +0100 @@ -2,7 +2,7 @@ * * This file is a part of LEMON, a generic C++ optimization library. * - * Copyright (C) 2003-2008 + * Copyright (C) 2003-2010 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport * (Egervary Research Group on Combinatorial Optimization, EGRES). * diff -r 02083323ff2c -r ef12f83752f6 license.dox --- a/license.dox Mon Feb 15 01:47:33 2010 +0100 +++ b/license.dox Mon Feb 15 01:51:58 2010 +0100 @@ -2,7 +2,7 @@ * * This file is a part of LEMON, a generic C++ optimization library. * - * Copyright (C) 2003-2009 + * Copyright (C) 2003-2010 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport * (Egervary Research Group on Combinatorial Optimization, EGRES). * diff -r 02083323ff2c -r ef12f83752f6 lp.dox --- a/lp.dox Mon Feb 15 01:47:33 2010 +0100 +++ b/lp.dox Mon Feb 15 01:51:58 2010 +0100 @@ -2,7 +2,7 @@ * * This file is a part of LEMON, a generic C++ optimization library. * - * Copyright (C) 2003-2009 + * Copyright (C) 2003-2010 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport * (Egervary Research Group on Combinatorial Optimization, EGRES). * @@ -100,4 +100,4 @@ [TRAILER] */ -} \ No newline at end of file +} diff -r 02083323ff2c -r ef12f83752f6 mainpage.dox --- a/mainpage.dox Mon Feb 15 01:47:33 2010 +0100 +++ b/mainpage.dox Mon Feb 15 01:51:58 2010 +0100 @@ -2,7 +2,7 @@ * * This file is a part of LEMON, a generic C++ optimization library. * - * Copyright (C) 2003-2009 + * Copyright (C) 2003-2010 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport * (Egervary Research Group on Combinatorial Optimization, EGRES). * diff -r 02083323ff2c -r ef12f83752f6 tools.dox --- a/tools.dox Mon Feb 15 01:47:33 2010 +0100 +++ b/tools.dox Mon Feb 15 01:51:58 2010 +0100 @@ -2,7 +2,7 @@ * * This file is a part of LEMON, a generic C++ optimization library. * - * Copyright (C) 2003-2009 + * Copyright (C) 2003-2010 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport * (Egervary Research Group on Combinatorial Optimization, EGRES). * @@ -45,7 +45,7 @@ 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 -parameters. The following code demonstrates its typical use. +parameters. The following code demonstrates its typical use. \code graphToEps(g, "graph.eps")