1.1 --- a/test/dijkstra_test.cc	Wed Mar 17 12:35:52 2010 +0100
     1.2 +++ b/test/dijkstra_test.cc	Sat Mar 06 14:35:12 2010 +0000
     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 @@ -85,7 +85,7 @@
    1.13      n = const_dijkstra_test.nextNode();
    1.14      b = const_dijkstra_test.emptyQueue();
    1.15      i = const_dijkstra_test.queueSize();
    1.16 -    
    1.17 +
    1.18      dijkstra_test.start();
    1.19      dijkstra_test.start(t);
    1.20      dijkstra_test.start(nm);
    1.21 @@ -109,7 +109,7 @@
    1.22        ::SetOperationTraits<DijkstraDefaultOperationTraits<VType> >
    1.23        ::SetHeap<BinHeap<VType, concepts::ReadWriteMap<Node,int> > >
    1.24        ::SetStandardHeap<BinHeap<VType, concepts::ReadWriteMap<Node,int> > >
    1.25 -      ::SetHeap<BinHeap<VType, concepts::ReadWriteMap<Node,int> >, 
    1.26 +      ::SetHeap<BinHeap<VType, concepts::ReadWriteMap<Node,int> >,
    1.27                  concepts::ReadWriteMap<Node,int> >
    1.28        ::Create dijkstra_test(G,length);
    1.29  
    1.30 @@ -119,7 +119,7 @@
    1.31      concepts::WriteMap<Node,bool> processed_map;
    1.32      concepts::ReadWriteMap<Node,int> heap_cross_ref;
    1.33      BinHeap<VType, concepts::ReadWriteMap<Node,int> > heap(heap_cross_ref);
    1.34 -    
    1.35 +
    1.36      dijkstra_test
    1.37        .lengthMap(length_map)
    1.38        .predMap(pred_map)
    1.39 @@ -136,7 +136,7 @@
    1.40      n = dijkstra_test.nextNode();
    1.41      b = dijkstra_test.emptyQueue();
    1.42      i = dijkstra_test.queueSize();
    1.43 -    
    1.44 +
    1.45      dijkstra_test.start();
    1.46      dijkstra_test.start(t);
    1.47      dijkstra_test.start(nm);