1.1 --- a/lemon/suurballe.h Sun Dec 21 20:47:15 2008 +0100
1.2 +++ b/lemon/suurballe.h Thu Jan 01 00:00:00 2009 +0100
1.3 @@ -1,8 +1,8 @@
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 + * Copyright (C) 2003-2009
1.12 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
1.13 * (Egervary Research Group on Combinatorial Optimization, EGRES).
1.14 *
1.15 @@ -76,7 +76,7 @@
1.16 typedef SimplePath<Digraph> Path;
1.17
1.18 private:
1.19 -
1.20 +
1.21 /// \brief Special implementation of the Dijkstra algorithm
1.22 /// for finding shortest paths in the residual network.
1.23 ///
1.24 @@ -106,7 +106,7 @@
1.25 PredMap &_pred;
1.26 // The processed (i.e. permanently labeled) nodes
1.27 std::vector<Node> _proc_nodes;
1.28 -
1.29 +
1.30 Node _s;
1.31 Node _t;
1.32
1.33 @@ -200,7 +200,7 @@
1.34 const Digraph &_graph;
1.35 // The length map
1.36 const LengthMap &_length;
1.37 -
1.38 +
1.39 // Arc map of the current flow
1.40 FlowMap *_flow;
1.41 bool _local_flow;
1.42 @@ -268,7 +268,7 @@
1.43 ///
1.44 /// This function sets the potential map.
1.45 ///
1.46 - /// The potentials provide the dual solution of the underlying
1.47 + /// The potentials provide the dual solution of the underlying
1.48 /// minimum cost flow problem.
1.49 ///
1.50 /// \return \c (*this)
1.51 @@ -330,7 +330,7 @@
1.52 for (ArcIt e(_graph); e != INVALID; ++e) (*_flow)[e] = 0;
1.53 for (NodeIt n(_graph); n != INVALID; ++n) (*_potential)[n] = 0;
1.54
1.55 - _dijkstra = new ResidualDijkstra( _graph, *_flow, _length,
1.56 + _dijkstra = new ResidualDijkstra( _graph, *_flow, _length,
1.57 *_potential, _pred,
1.58 _source, _target );
1.59 }
1.60 @@ -370,7 +370,7 @@
1.61 }
1.62 return _path_num;
1.63 }
1.64 -
1.65 +
1.66 /// \brief Compute the paths from the flow.
1.67 ///
1.68 /// This function computes the paths from the flow.