1.1 --- a/lemon/bits/path_dump.h Sun Jul 13 16:46:56 2008 +0100
1.2 +++ b/lemon/bits/path_dump.h Sun Jul 13 19:51:02 2008 +0100
1.3 @@ -1,6 +1,6 @@
1.4 -/* -*- C++ -*-
1.5 +/* -*- mode: C++; indent-tabs-mode: nil; -*-
1.6 *
1.7 - * This file is a part of LEMON, a generic C++ optimization library
1.8 + * This file is a part of LEMON, a generic C++ optimization library.
1.9 *
1.10 * Copyright (C) 2003-2008
1.11 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
1.12 @@ -53,7 +53,7 @@
1.13 public:
1.14 RevArcIt() {}
1.15 RevArcIt(Invalid) : path(0), current(INVALID) {}
1.16 - RevArcIt(const PredMapPath& _path)
1.17 + RevArcIt(const PredMapPath& _path)
1.18 : path(&_path), current(_path.target) {
1.19 if (path->predMap[current] == INVALID) current = INVALID;
1.20 }
1.21 @@ -68,18 +68,18 @@
1.22 return *this;
1.23 }
1.24
1.25 - bool operator==(const RevArcIt& e) const {
1.26 - return current == e.current;
1.27 + bool operator==(const RevArcIt& e) const {
1.28 + return current == e.current;
1.29 }
1.30
1.31 bool operator!=(const RevArcIt& e) const {
1.32 - return current != e.current;
1.33 + return current != e.current;
1.34 }
1.35
1.36 - bool operator<(const RevArcIt& e) const {
1.37 - return current < e.current;
1.38 + bool operator<(const RevArcIt& e) const {
1.39 + return current < e.current;
1.40 }
1.41 -
1.42 +
1.43 private:
1.44 const PredMapPath* path;
1.45 typename Digraph::Node current;
1.46 @@ -101,11 +101,11 @@
1.47 typedef typename Digraph::Arc Arc;
1.48 typedef _PredMatrixMap PredMatrixMap;
1.49
1.50 - PredMatrixMapPath(const Digraph& _digraph,
1.51 + PredMatrixMapPath(const Digraph& _digraph,
1.52 const PredMatrixMap& _predMatrixMap,
1.53 - typename Digraph::Node _source,
1.54 + typename Digraph::Node _source,
1.55 typename Digraph::Node _target)
1.56 - : digraph(_digraph), predMatrixMap(_predMatrixMap),
1.57 + : digraph(_digraph), predMatrixMap(_predMatrixMap),
1.58 source(_source), target(_target) {}
1.59
1.60 int length() const {
1.61 @@ -127,9 +127,9 @@
1.62 public:
1.63 RevArcIt() {}
1.64 RevArcIt(Invalid) : path(0), current(INVALID) {}
1.65 - RevArcIt(const PredMatrixMapPath& _path)
1.66 + RevArcIt(const PredMatrixMapPath& _path)
1.67 : path(&_path), current(_path.target) {
1.68 - if (path->predMatrixMap(path->source, current) == INVALID)
1.69 + if (path->predMatrixMap(path->source, current) == INVALID)
1.70 current = INVALID;
1.71 }
1.72
1.73 @@ -138,25 +138,25 @@
1.74 }
1.75
1.76 RevArcIt& operator++() {
1.77 - current =
1.78 + current =
1.79 path->digraph.source(path->predMatrixMap(path->source, current));
1.80 - if (path->predMatrixMap(path->source, current) == INVALID)
1.81 + if (path->predMatrixMap(path->source, current) == INVALID)
1.82 current = INVALID;
1.83 return *this;
1.84 }
1.85
1.86 - bool operator==(const RevArcIt& e) const {
1.87 - return current == e.current;
1.88 + bool operator==(const RevArcIt& e) const {
1.89 + return current == e.current;
1.90 }
1.91
1.92 bool operator!=(const RevArcIt& e) const {
1.93 - return current != e.current;
1.94 + return current != e.current;
1.95 }
1.96
1.97 - bool operator<(const RevArcIt& e) const {
1.98 - return current < e.current;
1.99 + bool operator<(const RevArcIt& e) const {
1.100 + return current < e.current;
1.101 }
1.102 -
1.103 +
1.104 private:
1.105 const PredMatrixMapPath* path;
1.106 typename Digraph::Node current;