Changeset 32:ef12f83752f6 in lemon-tutorial

Timestamp:

02/15/10 01:51:58 (15 years ago)

Author:

Peter Kovacs <kpeter@…>

Branch:

default

Phase:

public

Message:

Happy New Year + unify files

Files:

• adaptors.dox (modified) (3 diffs)
• basics.dox (modified) (3 diffs)
• getting_started.dox (modified) (1 diff)
• graphs.dox (modified) (8 diffs)
• intro.dox (modified) (2 diffs)
• lgf.dox (modified) (1 diff)
• license.dox (modified) (1 diff)
• lp.dox (modified) (1 diff)
• mainpage.dox (modified) (1 diff)
• tools.dox (modified) (2 diffs)

adaptors.dox

@@ -3 +3 @@
  * 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).
@@ -119 +119 @@
 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 +132 @@
 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

basics.dox

@@ -3 +3 @@
  * 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).
@@ -125 +125 @@
 \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 +155 @@
 
 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

getting_started.dox

@@ -3 +3 @@
  * 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).

graphs.dox

@@ -3 +3 @@
  * 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).
@@ -39 +39 @@
 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 +51 @@
 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 +67 @@
 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 +82 @@
 
 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 +99 @@
 \code
   ListGraph g;
-  
+
   ListGraph::Node a = g.addNode();
   ListGraph::Node b = g.addNode();
@@ -134 +134 @@
   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 +184 @@
   std::cout << arc_cost[a1] << ", " << arc_cost[a2] << std::endl;
 \endcode
- 
+
 [SEC]sec_special_graphs[SEC] Special Graph Structures
 

intro.dox

@@ -3 +3 @@
  * 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).
@@ -26 +26 @@
 efficient implementations of common data structures and algorithms with
 focus on combinatorial optimization tasks connected mainly with graphs
-and networks. 
+and networks.
 
 <b>LEMON is an <a class="el" href="http://opensource.org/">open&nbsp;source</a>

lgf.dox

@@ -3 +3 @@
  * 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).

license.dox

@@ -3 +3 @@
  * 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).

lp.dox

@@ -3 +3 @@
  * 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).

mainpage.dox

@@ -3 +3 @@
  * 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).

tools.dox

@@ -3 +3 @@
  * 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).
@@ -46 +46 @@
 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