1.1 --- a/lemon/full_graph.h	Fri Aug 09 14:07:27 2013 +0200
     1.2 +++ b/lemon/full_graph.h	Fri Aug 09 11:28:17 2013 +0200
     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-2010
     1.8 + * Copyright (C) 2003-2013
     1.9   * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.10   * (Egervary Research Group on Combinatorial Optimization, EGRES).
    1.11   *
    1.12 @@ -874,7 +874,7 @@
    1.13      int id(const BlueNode& v) const { return v._id - _red_num; }
    1.14      static int id(Arc e) { return e._id; }
    1.15      static int id(Edge e) { return e._id; }
    1.16 -    
    1.17 +
    1.18      static Node nodeFromId(int id) { return Node(id);}
    1.19      static Arc arcFromId(int id) { return Arc(id);}
    1.20      static Edge edgeFromId(int id) { return Edge(id);}
    1.21 @@ -904,13 +904,13 @@
    1.22      int index(BlueNode n) const {
    1.23        return n._id - _red_num;
    1.24      }
    1.25 -        
    1.26 +
    1.27      void clear() {
    1.28        _red_num = 0; _blue_num = 0;
    1.29        _node_num = 0; _edge_num = 0;
    1.30      }
    1.31  
    1.32 -    Edge edge(const Node& u, const Node& v) const { 
    1.33 +    Edge edge(const Node& u, const Node& v) const {
    1.34        if (u._id < _red_num) {
    1.35          if (v._id < _red_num) {
    1.36            return Edge(-1);
    1.37 @@ -926,7 +926,7 @@
    1.38        }
    1.39      }
    1.40  
    1.41 -    Arc arc(const Node& u, const Node& v) const { 
    1.42 +    Arc arc(const Node& u, const Node& v) const {
    1.43        if (u._id < _red_num) {
    1.44          if (v._id < _red_num) {
    1.45            return Arc(-1);