1.1 --- a/lemon/howard_mmc.h Wed Mar 17 12:35:52 2010 +0100
1.2 +++ b/lemon/howard_mmc.h Sat Mar 06 14:35:12 2010 +0000
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-2010
1.12 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
1.13 * (Egervary Research Group on Combinatorial Optimization, EGRES).
1.14 *
1.15 @@ -121,7 +121,7 @@
1.16 class HowardMmc
1.17 {
1.18 public:
1.19 -
1.20 +
1.21 /// The type of the digraph
1.22 typedef typename TR::Digraph Digraph;
1.23 /// The type of the cost map
1.24 @@ -152,7 +152,7 @@
1.25 private:
1.26
1.27 TEMPLATE_DIGRAPH_TYPEDEFS(Digraph);
1.28 -
1.29 +
1.30 // The digraph the algorithm runs on
1.31 const Digraph &_gr;
1.32 // The cost of the arcs
1.33 @@ -179,18 +179,18 @@
1.34 std::vector<std::vector<Node> > _comp_nodes;
1.35 std::vector<Node>* _nodes;
1.36 typename Digraph::template NodeMap<std::vector<Arc> > _in_arcs;
1.37 -
1.38 +
1.39 // Queue used for BFS search
1.40 std::vector<Node> _queue;
1.41 int _qfront, _qback;
1.42
1.43 Tolerance _tolerance;
1.44 -
1.45 +
1.46 // Infinite constant
1.47 const LargeCost INF;
1.48
1.49 public:
1.50 -
1.51 +
1.52 /// \name Named Template Parameters
1.53 /// @{
1.54
1.55 @@ -228,7 +228,7 @@
1.56 : public HowardMmc<GR, CM, SetPathTraits<T> > {
1.57 typedef HowardMmc<GR, CM, SetPathTraits<T> > Create;
1.58 };
1.59 -
1.60 +
1.61 /// @}
1.62
1.63 protected:
1.64 @@ -334,7 +334,7 @@
1.65 // Initialize and find strongly connected components
1.66 init();
1.67 findComponents();
1.68 -
1.69 +
1.70 // Find the minimum cycle mean in the components
1.71 for (int comp = 0; comp < _comp_num; ++comp) {
1.72 // Find the minimum mean cycle in the current component
1.73 @@ -445,7 +445,7 @@
1.74 _best_size = 1;
1.75 _cycle_path->clear();
1.76 }
1.77 -
1.78 +
1.79 // Find strongly connected components and initialize _comp_nodes
1.80 // and _in_arcs
1.81 void findComponents() {