1.1 --- a/graphs.dox	Mon Feb 15 01:47:33 2010 +0100
     1.2 +++ b/graphs.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 @@ -38,7 +38,7 @@
    1.13  
    1.14  In LEMON, there are various graph types, which are rather different, but
    1.15  they all conform to the corresponding \ref graph_concepts "graph concept",
    1.16 -which defines the common part of the graph interfaces. 
    1.17 +which defines the common part of the graph interfaces.
    1.18  The \ref concepts::Digraph "Digraph concept" describes the common interface
    1.19  of directed graphs (without any sensible implementation), while
    1.20  the \ref concepts::Graph "Graph concept" describes the undirected graphs.
    1.21 @@ -50,7 +50,7 @@
    1.22  The graph %concepts define the member classes for the iterators and maps
    1.23  along with some useful basic functions for obtaining the identifiers of
    1.24  the items, the end nodes of the arcs (or edges) and their iterators,
    1.25 -etc. 
    1.26 +etc.
    1.27  An actual graph implementation may have various additional functionalities
    1.28  according to its purpose.
    1.29  
    1.30 @@ -66,7 +66,7 @@
    1.31  \ref SmartDigraph is another general digraph implementation, which is
    1.32  significantly more efficient (both in terms of space and time), but it
    1.33  provides less functionality. For example, nodes and arcs cannot be
    1.34 -removed from it. 
    1.35 +removed from it.
    1.36  
    1.37  \ref FullDigraph is an efficient implementation of a directed full graph.
    1.38  This structure is completely static, so you can neither add nor delete
    1.39 @@ -81,7 +81,7 @@
    1.40  They provide similar features to the digraph structures.
    1.41  
    1.42  The \ref concepts::Graph "undirected graphs" also fulfill the concept of
    1.43 -\ref concepts::Digraph "directed graphs", in such a way that each 
    1.44 +\ref concepts::Digraph "directed graphs", in such a way that each
    1.45  undirected \e edge of a graph can also be regarded as two oppositely
    1.46  directed \e arcs. As a result, all directed graph algorithms automatically
    1.47  run on undirected graphs, as well.
    1.48 @@ -98,7 +98,7 @@
    1.49  For example,
    1.50  \code
    1.51    ListGraph g;
    1.52 -  
    1.53 +
    1.54    ListGraph::Node a = g.addNode();
    1.55    ListGraph::Node b = g.addNode();
    1.56    ListGraph::Node c = g.addNode();
    1.57 @@ -133,7 +133,7 @@
    1.58  \code
    1.59    std::cout << "Edge " << g.id(e) << " connects node "
    1.60      << g.id(g.u(e)) << " and node " << g.id(g.v(e)) << std::endl;
    1.61 -  
    1.62 +
    1.63    std::cout << "Arc " << g.id(a2) << " goes from node "
    1.64      << g.id(g.source(a2)) << " to node " << g.id(g.target(a2)) << std::endl;
    1.65  \endcode
    1.66 @@ -183,7 +183,7 @@
    1.67    // std::cout << arc_cost[e] << std::endl;   // this is not valid
    1.68    std::cout << arc_cost[a1] << ", " << arc_cost[a2] << std::endl;
    1.69  \endcode
    1.70 - 
    1.71 +
    1.72  [SEC]sec_special_graphs[SEC] Special Graph Structures
    1.73  
    1.74  In addition to the general undirected classes \ref ListGraph and