lemon/karp.h
author Peter Kovacs <kpeter@inf.elte.hu>
Tue, 11 Aug 2009 21:53:39 +0200
changeset 766 97744b6dabf8
child 767 11c946fa8d13
permissions -rw-r--r--
Add HartmannOrlin algorithm class (#179)
This algorithm is an improved version of Karp's original method,
it applies an efficient early termination scheme.
The interface is the same as Karp's and Howard's interface.
kpeter@765
     1
/* -*- C++ -*-
kpeter@765
     2
 *
kpeter@765
     3
 * This file is a part of LEMON, a generic C++ optimization library
kpeter@765
     4
 *
kpeter@765
     5
 * Copyright (C) 2003-2008
kpeter@765
     6
 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
kpeter@765
     7
 * (Egervary Research Group on Combinatorial Optimization, EGRES).
kpeter@765
     8
 *
kpeter@765
     9
 * Permission to use, modify and distribute this software is granted
kpeter@765
    10
 * provided that this copyright notice appears in all copies. For
kpeter@765
    11
 * precise terms see the accompanying LICENSE file.
kpeter@765
    12
 *
kpeter@765
    13
 * This software is provided "AS IS" with no warranty of any kind,
kpeter@765
    14
 * express or implied, and with no claim as to its suitability for any
kpeter@765
    15
 * purpose.
kpeter@765
    16
 *
kpeter@765
    17
 */
kpeter@765
    18
kpeter@765
    19
#ifndef LEMON_KARP_H
kpeter@765
    20
#define LEMON_KARP_H
kpeter@765
    21
kpeter@765
    22
/// \ingroup shortest_path
kpeter@765
    23
///
kpeter@765
    24
/// \file
kpeter@765
    25
/// \brief Karp's algorithm for finding a minimum mean cycle.
kpeter@765
    26
kpeter@765
    27
#include <vector>
kpeter@765
    28
#include <limits>
kpeter@765
    29
#include <lemon/core.h>
kpeter@765
    30
#include <lemon/path.h>
kpeter@765
    31
#include <lemon/tolerance.h>
kpeter@765
    32
#include <lemon/connectivity.h>
kpeter@765
    33
kpeter@765
    34
namespace lemon {
kpeter@765
    35
kpeter@765
    36
  /// \brief Default traits class of Karp algorithm.
kpeter@765
    37
  ///
kpeter@765
    38
  /// Default traits class of Karp algorithm.
kpeter@765
    39
  /// \tparam GR The type of the digraph.
kpeter@765
    40
  /// \tparam LEN The type of the length map.
kpeter@765
    41
  /// It must conform to the \ref concepts::ReadMap "ReadMap" concept.
kpeter@765
    42
#ifdef DOXYGEN
kpeter@765
    43
  template <typename GR, typename LEN>
kpeter@765
    44
#else
kpeter@765
    45
  template <typename GR, typename LEN,
kpeter@765
    46
    bool integer = std::numeric_limits<typename LEN::Value>::is_integer>
kpeter@765
    47
#endif
kpeter@765
    48
  struct KarpDefaultTraits
kpeter@765
    49
  {
kpeter@765
    50
    /// The type of the digraph
kpeter@765
    51
    typedef GR Digraph;
kpeter@765
    52
    /// The type of the length map
kpeter@765
    53
    typedef LEN LengthMap;
kpeter@765
    54
    /// The type of the arc lengths
kpeter@765
    55
    typedef typename LengthMap::Value Value;
kpeter@765
    56
kpeter@765
    57
    /// \brief The large value type used for internal computations
kpeter@765
    58
    ///
kpeter@765
    59
    /// The large value type used for internal computations.
kpeter@765
    60
    /// It is \c long \c long if the \c Value type is integer,
kpeter@765
    61
    /// otherwise it is \c double.
kpeter@765
    62
    /// \c Value must be convertible to \c LargeValue.
kpeter@765
    63
    typedef double LargeValue;
kpeter@765
    64
kpeter@765
    65
    /// The tolerance type used for internal computations
kpeter@765
    66
    typedef lemon::Tolerance<LargeValue> Tolerance;
kpeter@765
    67
kpeter@765
    68
    /// \brief The path type of the found cycles
kpeter@765
    69
    ///
kpeter@765
    70
    /// The path type of the found cycles.
kpeter@765
    71
    /// It must conform to the \ref lemon::concepts::Path "Path" concept
kpeter@765
    72
    /// and it must have an \c addBack() function.
kpeter@765
    73
    typedef lemon::Path<Digraph> Path;
kpeter@765
    74
  };
kpeter@765
    75
kpeter@765
    76
  // Default traits class for integer value types
kpeter@765
    77
  template <typename GR, typename LEN>
kpeter@765
    78
  struct KarpDefaultTraits<GR, LEN, true>
kpeter@765
    79
  {
kpeter@765
    80
    typedef GR Digraph;
kpeter@765
    81
    typedef LEN LengthMap;
kpeter@765
    82
    typedef typename LengthMap::Value Value;
kpeter@765
    83
#ifdef LEMON_HAVE_LONG_LONG
kpeter@765
    84
    typedef long long LargeValue;
kpeter@765
    85
#else
kpeter@765
    86
    typedef long LargeValue;
kpeter@765
    87
#endif
kpeter@765
    88
    typedef lemon::Tolerance<LargeValue> Tolerance;
kpeter@765
    89
    typedef lemon::Path<Digraph> Path;
kpeter@765
    90
  };
kpeter@765
    91
kpeter@765
    92
kpeter@765
    93
  /// \addtogroup shortest_path
kpeter@765
    94
  /// @{
kpeter@765
    95
kpeter@765
    96
  /// \brief Implementation of Karp's algorithm for finding a minimum
kpeter@765
    97
  /// mean cycle.
kpeter@765
    98
  ///
kpeter@765
    99
  /// This class implements Karp's algorithm for finding a directed
kpeter@765
   100
  /// cycle of minimum mean length (cost) in a digraph.
kpeter@765
   101
  ///
kpeter@765
   102
  /// \tparam GR The type of the digraph the algorithm runs on.
kpeter@765
   103
  /// \tparam LEN The type of the length map. The default
kpeter@765
   104
  /// map type is \ref concepts::Digraph::ArcMap "GR::ArcMap<int>".
kpeter@765
   105
#ifdef DOXYGEN
kpeter@765
   106
  template <typename GR, typename LEN, typename TR>
kpeter@765
   107
#else
kpeter@765
   108
  template < typename GR,
kpeter@765
   109
             typename LEN = typename GR::template ArcMap<int>,
kpeter@765
   110
             typename TR = KarpDefaultTraits<GR, LEN> >
kpeter@765
   111
#endif
kpeter@765
   112
  class Karp
kpeter@765
   113
  {
kpeter@765
   114
  public:
kpeter@765
   115
kpeter@765
   116
    /// The type of the digraph
kpeter@765
   117
    typedef typename TR::Digraph Digraph;
kpeter@765
   118
    /// The type of the length map
kpeter@765
   119
    typedef typename TR::LengthMap LengthMap;
kpeter@765
   120
    /// The type of the arc lengths
kpeter@765
   121
    typedef typename TR::Value Value;
kpeter@765
   122
kpeter@765
   123
    /// \brief The large value type
kpeter@765
   124
    ///
kpeter@765
   125
    /// The large value type used for internal computations.
kpeter@765
   126
    /// Using the \ref KarpDefaultTraits "default traits class",
kpeter@765
   127
    /// it is \c long \c long if the \c Value type is integer,
kpeter@765
   128
    /// otherwise it is \c double.
kpeter@765
   129
    typedef typename TR::LargeValue LargeValue;
kpeter@765
   130
kpeter@765
   131
    /// The tolerance type
kpeter@765
   132
    typedef typename TR::Tolerance Tolerance;
kpeter@765
   133
kpeter@765
   134
    /// \brief The path type of the found cycles
kpeter@765
   135
    ///
kpeter@765
   136
    /// The path type of the found cycles.
kpeter@765
   137
    /// Using the \ref KarpDefaultTraits "default traits class",
kpeter@765
   138
    /// it is \ref lemon::Path "Path<Digraph>".
kpeter@765
   139
    typedef typename TR::Path Path;
kpeter@765
   140
kpeter@765
   141
    /// The \ref KarpDefaultTraits "traits class" of the algorithm
kpeter@765
   142
    typedef TR Traits;
kpeter@765
   143
kpeter@765
   144
  private:
kpeter@765
   145
kpeter@765
   146
    TEMPLATE_DIGRAPH_TYPEDEFS(Digraph);
kpeter@765
   147
kpeter@765
   148
    // Data sturcture for path data
kpeter@765
   149
    struct PathData
kpeter@765
   150
    {
kpeter@765
   151
      bool found;
kpeter@765
   152
      LargeValue dist;
kpeter@765
   153
      Arc pred;
kpeter@765
   154
      PathData(bool f = false, LargeValue d = 0, Arc p = INVALID) :
kpeter@765
   155
        found(f), dist(d), pred(p) {}
kpeter@765
   156
    };
kpeter@765
   157
kpeter@765
   158
    typedef typename Digraph::template NodeMap<std::vector<PathData> >
kpeter@765
   159
      PathDataNodeMap;
kpeter@765
   160
kpeter@765
   161
  private:
kpeter@765
   162
kpeter@765
   163
    // The digraph the algorithm runs on
kpeter@765
   164
    const Digraph &_gr;
kpeter@765
   165
    // The length of the arcs
kpeter@765
   166
    const LengthMap &_length;
kpeter@765
   167
kpeter@765
   168
    // Data for storing the strongly connected components
kpeter@765
   169
    int _comp_num;
kpeter@765
   170
    typename Digraph::template NodeMap<int> _comp;
kpeter@765
   171
    std::vector<std::vector<Node> > _comp_nodes;
kpeter@765
   172
    std::vector<Node>* _nodes;
kpeter@765
   173
    typename Digraph::template NodeMap<std::vector<Arc> > _out_arcs;
kpeter@765
   174
kpeter@765
   175
    // Data for the found cycle
kpeter@765
   176
    LargeValue _cycle_length;
kpeter@765
   177
    int _cycle_size;
kpeter@765
   178
    Node _cycle_node;
kpeter@765
   179
kpeter@765
   180
    Path *_cycle_path;
kpeter@765
   181
    bool _local_path;
kpeter@765
   182
kpeter@765
   183
    // Node map for storing path data
kpeter@765
   184
    PathDataNodeMap _data;
kpeter@765
   185
    // The processed nodes in the last round
kpeter@765
   186
    std::vector<Node> _process;
kpeter@765
   187
kpeter@765
   188
    Tolerance _tolerance;
kpeter@765
   189
kpeter@765
   190
  public:
kpeter@765
   191
kpeter@765
   192
    /// \name Named Template Parameters
kpeter@765
   193
    /// @{
kpeter@765
   194
kpeter@765
   195
    template <typename T>
kpeter@765
   196
    struct SetLargeValueTraits : public Traits {
kpeter@765
   197
      typedef T LargeValue;
kpeter@765
   198
      typedef lemon::Tolerance<T> Tolerance;
kpeter@765
   199
    };
kpeter@765
   200
kpeter@765
   201
    /// \brief \ref named-templ-param "Named parameter" for setting
kpeter@765
   202
    /// \c LargeValue type.
kpeter@765
   203
    ///
kpeter@765
   204
    /// \ref named-templ-param "Named parameter" for setting \c LargeValue
kpeter@765
   205
    /// type. It is used for internal computations in the algorithm.
kpeter@765
   206
    template <typename T>
kpeter@765
   207
    struct SetLargeValue
kpeter@765
   208
      : public Karp<GR, LEN, SetLargeValueTraits<T> > {
kpeter@765
   209
      typedef Karp<GR, LEN, SetLargeValueTraits<T> > Create;
kpeter@765
   210
    };
kpeter@765
   211
kpeter@765
   212
    template <typename T>
kpeter@765
   213
    struct SetPathTraits : public Traits {
kpeter@765
   214
      typedef T Path;
kpeter@765
   215
    };
kpeter@765
   216
kpeter@765
   217
    /// \brief \ref named-templ-param "Named parameter" for setting
kpeter@765
   218
    /// \c %Path type.
kpeter@765
   219
    ///
kpeter@765
   220
    /// \ref named-templ-param "Named parameter" for setting the \c %Path
kpeter@765
   221
    /// type of the found cycles.
kpeter@765
   222
    /// It must conform to the \ref lemon::concepts::Path "Path" concept
kpeter@765
   223
    /// and it must have an \c addFront() function.
kpeter@765
   224
    template <typename T>
kpeter@765
   225
    struct SetPath
kpeter@765
   226
      : public Karp<GR, LEN, SetPathTraits<T> > {
kpeter@765
   227
      typedef Karp<GR, LEN, SetPathTraits<T> > Create;
kpeter@765
   228
    };
kpeter@765
   229
kpeter@765
   230
    /// @}
kpeter@765
   231
kpeter@765
   232
  public:
kpeter@765
   233
kpeter@765
   234
    /// \brief Constructor.
kpeter@765
   235
    ///
kpeter@765
   236
    /// The constructor of the class.
kpeter@765
   237
    ///
kpeter@765
   238
    /// \param digraph The digraph the algorithm runs on.
kpeter@765
   239
    /// \param length The lengths (costs) of the arcs.
kpeter@765
   240
    Karp( const Digraph &digraph,
kpeter@765
   241
          const LengthMap &length ) :
kpeter@765
   242
      _gr(digraph), _length(length), _comp(digraph), _out_arcs(digraph),
kpeter@765
   243
      _cycle_length(0), _cycle_size(1), _cycle_node(INVALID),
kpeter@765
   244
      _cycle_path(NULL), _local_path(false), _data(digraph)
kpeter@765
   245
    {}
kpeter@765
   246
kpeter@765
   247
    /// Destructor.
kpeter@765
   248
    ~Karp() {
kpeter@765
   249
      if (_local_path) delete _cycle_path;
kpeter@765
   250
    }
kpeter@765
   251
kpeter@765
   252
    /// \brief Set the path structure for storing the found cycle.
kpeter@765
   253
    ///
kpeter@765
   254
    /// This function sets an external path structure for storing the
kpeter@765
   255
    /// found cycle.
kpeter@765
   256
    ///
kpeter@765
   257
    /// If you don't call this function before calling \ref run() or
kpeter@765
   258
    /// \ref findMinMean(), it will allocate a local \ref Path "path"
kpeter@765
   259
    /// structure. The destuctor deallocates this automatically
kpeter@765
   260
    /// allocated object, of course.
kpeter@765
   261
    ///
kpeter@765
   262
    /// \note The algorithm calls only the \ref lemon::Path::addFront()
kpeter@765
   263
    /// "addFront()" function of the given path structure.
kpeter@765
   264
    ///
kpeter@765
   265
    /// \return <tt>(*this)</tt>
kpeter@765
   266
    Karp& cycle(Path &path) {
kpeter@765
   267
      if (_local_path) {
kpeter@765
   268
        delete _cycle_path;
kpeter@765
   269
        _local_path = false;
kpeter@765
   270
      }
kpeter@765
   271
      _cycle_path = &path;
kpeter@765
   272
      return *this;
kpeter@765
   273
    }
kpeter@765
   274
kpeter@765
   275
    /// \name Execution control
kpeter@765
   276
    /// The simplest way to execute the algorithm is to call the \ref run()
kpeter@765
   277
    /// function.\n
kpeter@765
   278
    /// If you only need the minimum mean length, you may call
kpeter@765
   279
    /// \ref findMinMean().
kpeter@765
   280
kpeter@765
   281
    /// @{
kpeter@765
   282
kpeter@765
   283
    /// \brief Run the algorithm.
kpeter@765
   284
    ///
kpeter@765
   285
    /// This function runs the algorithm.
kpeter@765
   286
    /// It can be called more than once (e.g. if the underlying digraph
kpeter@765
   287
    /// and/or the arc lengths have been modified).
kpeter@765
   288
    ///
kpeter@765
   289
    /// \return \c true if a directed cycle exists in the digraph.
kpeter@765
   290
    ///
kpeter@765
   291
    /// \note <tt>mmc.run()</tt> is just a shortcut of the following code.
kpeter@765
   292
    /// \code
kpeter@765
   293
    ///   return mmc.findMinMean() && mmc.findCycle();
kpeter@765
   294
    /// \endcode
kpeter@765
   295
    bool run() {
kpeter@765
   296
      return findMinMean() && findCycle();
kpeter@765
   297
    }
kpeter@765
   298
kpeter@765
   299
    /// \brief Find the minimum cycle mean.
kpeter@765
   300
    ///
kpeter@765
   301
    /// This function finds the minimum mean length of the directed
kpeter@765
   302
    /// cycles in the digraph.
kpeter@765
   303
    ///
kpeter@765
   304
    /// \return \c true if a directed cycle exists in the digraph.
kpeter@765
   305
    bool findMinMean() {
kpeter@765
   306
      // Initialization and find strongly connected components
kpeter@765
   307
      init();
kpeter@765
   308
      findComponents();
kpeter@765
   309
      
kpeter@765
   310
      // Find the minimum cycle mean in the components
kpeter@765
   311
      for (int comp = 0; comp < _comp_num; ++comp) {
kpeter@765
   312
        if (!initComponent(comp)) continue;
kpeter@765
   313
        processRounds();
kpeter@765
   314
        updateMinMean();
kpeter@765
   315
      }
kpeter@765
   316
      return (_cycle_node != INVALID);
kpeter@765
   317
    }
kpeter@765
   318
kpeter@765
   319
    /// \brief Find a minimum mean directed cycle.
kpeter@765
   320
    ///
kpeter@765
   321
    /// This function finds a directed cycle of minimum mean length
kpeter@765
   322
    /// in the digraph using the data computed by findMinMean().
kpeter@765
   323
    ///
kpeter@765
   324
    /// \return \c true if a directed cycle exists in the digraph.
kpeter@765
   325
    ///
kpeter@765
   326
    /// \pre \ref findMinMean() must be called before using this function.
kpeter@765
   327
    bool findCycle() {
kpeter@765
   328
      if (_cycle_node == INVALID) return false;
kpeter@765
   329
      IntNodeMap reached(_gr, -1);
kpeter@765
   330
      int r = _data[_cycle_node].size();
kpeter@765
   331
      Node u = _cycle_node;
kpeter@765
   332
      while (reached[u] < 0) {
kpeter@765
   333
        reached[u] = --r;
kpeter@765
   334
        u = _gr.source(_data[u][r].pred);
kpeter@765
   335
      }
kpeter@765
   336
      r = reached[u];
kpeter@765
   337
      Arc e = _data[u][r].pred;
kpeter@765
   338
      _cycle_path->addFront(e);
kpeter@765
   339
      _cycle_length = _length[e];
kpeter@765
   340
      _cycle_size = 1;
kpeter@765
   341
      Node v;
kpeter@765
   342
      while ((v = _gr.source(e)) != u) {
kpeter@765
   343
        e = _data[v][--r].pred;
kpeter@765
   344
        _cycle_path->addFront(e);
kpeter@765
   345
        _cycle_length += _length[e];
kpeter@765
   346
        ++_cycle_size;
kpeter@765
   347
      }
kpeter@765
   348
      return true;
kpeter@765
   349
    }
kpeter@765
   350
kpeter@765
   351
    /// @}
kpeter@765
   352
kpeter@765
   353
    /// \name Query Functions
kpeter@765
   354
    /// The results of the algorithm can be obtained using these
kpeter@765
   355
    /// functions.\n
kpeter@765
   356
    /// The algorithm should be executed before using them.
kpeter@765
   357
kpeter@765
   358
    /// @{
kpeter@765
   359
kpeter@765
   360
    /// \brief Return the total length of the found cycle.
kpeter@765
   361
    ///
kpeter@765
   362
    /// This function returns the total length of the found cycle.
kpeter@765
   363
    ///
kpeter@765
   364
    /// \pre \ref run() or \ref findMinMean() must be called before
kpeter@765
   365
    /// using this function.
kpeter@765
   366
    LargeValue cycleLength() const {
kpeter@765
   367
      return _cycle_length;
kpeter@765
   368
    }
kpeter@765
   369
kpeter@765
   370
    /// \brief Return the number of arcs on the found cycle.
kpeter@765
   371
    ///
kpeter@765
   372
    /// This function returns the number of arcs on the found cycle.
kpeter@765
   373
    ///
kpeter@765
   374
    /// \pre \ref run() or \ref findMinMean() must be called before
kpeter@765
   375
    /// using this function.
kpeter@765
   376
    int cycleArcNum() const {
kpeter@765
   377
      return _cycle_size;
kpeter@765
   378
    }
kpeter@765
   379
kpeter@765
   380
    /// \brief Return the mean length of the found cycle.
kpeter@765
   381
    ///
kpeter@765
   382
    /// This function returns the mean length of the found cycle.
kpeter@765
   383
    ///
kpeter@765
   384
    /// \note <tt>alg.cycleMean()</tt> is just a shortcut of the
kpeter@765
   385
    /// following code.
kpeter@765
   386
    /// \code
kpeter@765
   387
    ///   return static_cast<double>(alg.cycleLength()) / alg.cycleArcNum();
kpeter@765
   388
    /// \endcode
kpeter@765
   389
    ///
kpeter@765
   390
    /// \pre \ref run() or \ref findMinMean() must be called before
kpeter@765
   391
    /// using this function.
kpeter@765
   392
    double cycleMean() const {
kpeter@765
   393
      return static_cast<double>(_cycle_length) / _cycle_size;
kpeter@765
   394
    }
kpeter@765
   395
kpeter@765
   396
    /// \brief Return the found cycle.
kpeter@765
   397
    ///
kpeter@765
   398
    /// This function returns a const reference to the path structure
kpeter@765
   399
    /// storing the found cycle.
kpeter@765
   400
    ///
kpeter@765
   401
    /// \pre \ref run() or \ref findCycle() must be called before using
kpeter@765
   402
    /// this function.
kpeter@765
   403
    const Path& cycle() const {
kpeter@765
   404
      return *_cycle_path;
kpeter@765
   405
    }
kpeter@765
   406
kpeter@765
   407
    ///@}
kpeter@765
   408
kpeter@765
   409
  private:
kpeter@765
   410
kpeter@765
   411
    // Initialization
kpeter@765
   412
    void init() {
kpeter@765
   413
      if (!_cycle_path) {
kpeter@765
   414
        _local_path = true;
kpeter@765
   415
        _cycle_path = new Path;
kpeter@765
   416
      }
kpeter@765
   417
      _cycle_path->clear();
kpeter@765
   418
      _cycle_length = 0;
kpeter@765
   419
      _cycle_size = 1;
kpeter@765
   420
      _cycle_node = INVALID;
kpeter@765
   421
      for (NodeIt u(_gr); u != INVALID; ++u)
kpeter@765
   422
        _data[u].clear();
kpeter@765
   423
    }
kpeter@765
   424
kpeter@765
   425
    // Find strongly connected components and initialize _comp_nodes
kpeter@765
   426
    // and _out_arcs
kpeter@765
   427
    void findComponents() {
kpeter@765
   428
      _comp_num = stronglyConnectedComponents(_gr, _comp);
kpeter@765
   429
      _comp_nodes.resize(_comp_num);
kpeter@765
   430
      if (_comp_num == 1) {
kpeter@765
   431
        _comp_nodes[0].clear();
kpeter@765
   432
        for (NodeIt n(_gr); n != INVALID; ++n) {
kpeter@765
   433
          _comp_nodes[0].push_back(n);
kpeter@765
   434
          _out_arcs[n].clear();
kpeter@765
   435
          for (OutArcIt a(_gr, n); a != INVALID; ++a) {
kpeter@765
   436
            _out_arcs[n].push_back(a);
kpeter@765
   437
          }
kpeter@765
   438
        }
kpeter@765
   439
      } else {
kpeter@765
   440
        for (int i = 0; i < _comp_num; ++i)
kpeter@765
   441
          _comp_nodes[i].clear();
kpeter@765
   442
        for (NodeIt n(_gr); n != INVALID; ++n) {
kpeter@765
   443
          int k = _comp[n];
kpeter@765
   444
          _comp_nodes[k].push_back(n);
kpeter@765
   445
          _out_arcs[n].clear();
kpeter@765
   446
          for (OutArcIt a(_gr, n); a != INVALID; ++a) {
kpeter@765
   447
            if (_comp[_gr.target(a)] == k) _out_arcs[n].push_back(a);
kpeter@765
   448
          }
kpeter@765
   449
        }
kpeter@765
   450
      }
kpeter@765
   451
    }
kpeter@765
   452
kpeter@765
   453
    // Initialize path data for the current component
kpeter@765
   454
    bool initComponent(int comp) {
kpeter@765
   455
      _nodes = &(_comp_nodes[comp]);
kpeter@765
   456
      int n = _nodes->size();
kpeter@765
   457
      if (n < 1 || (n == 1 && _out_arcs[(*_nodes)[0]].size() == 0)) {
kpeter@765
   458
        return false;
kpeter@765
   459
      }      
kpeter@765
   460
      for (int i = 0; i < n; ++i) {
kpeter@765
   461
        _data[(*_nodes)[i]].resize(n + 1);
kpeter@765
   462
      }
kpeter@765
   463
      return true;
kpeter@765
   464
    }
kpeter@765
   465
kpeter@765
   466
    // Process all rounds of computing path data for the current component.
kpeter@765
   467
    // _data[v][k] is the length of a shortest directed walk from the root
kpeter@765
   468
    // node to node v containing exactly k arcs.
kpeter@765
   469
    void processRounds() {
kpeter@765
   470
      Node start = (*_nodes)[0];
kpeter@765
   471
      _data[start][0] = PathData(true, 0);
kpeter@765
   472
      _process.clear();
kpeter@765
   473
      _process.push_back(start);
kpeter@765
   474
kpeter@765
   475
      int k, n = _nodes->size();
kpeter@765
   476
      for (k = 1; k <= n && int(_process.size()) < n; ++k) {
kpeter@765
   477
        processNextBuildRound(k);
kpeter@765
   478
      }
kpeter@765
   479
      for ( ; k <= n; ++k) {
kpeter@765
   480
        processNextFullRound(k);
kpeter@765
   481
      }
kpeter@765
   482
    }
kpeter@765
   483
kpeter@765
   484
    // Process one round and rebuild _process
kpeter@765
   485
    void processNextBuildRound(int k) {
kpeter@765
   486
      std::vector<Node> next;
kpeter@765
   487
      Node u, v;
kpeter@765
   488
      Arc e;
kpeter@765
   489
      LargeValue d;
kpeter@765
   490
      for (int i = 0; i < int(_process.size()); ++i) {
kpeter@765
   491
        u = _process[i];
kpeter@765
   492
        for (int j = 0; j < int(_out_arcs[u].size()); ++j) {
kpeter@765
   493
          e = _out_arcs[u][j];
kpeter@765
   494
          v = _gr.target(e);
kpeter@765
   495
          d = _data[u][k-1].dist + _length[e];
kpeter@765
   496
          if (!_data[v][k].found) {
kpeter@765
   497
            next.push_back(v);
kpeter@765
   498
            _data[v][k] = PathData(true, _data[u][k-1].dist + _length[e], e);
kpeter@765
   499
          }
kpeter@765
   500
          else if (_tolerance.less(d, _data[v][k].dist)) {
kpeter@765
   501
            _data[v][k] = PathData(true, d, e);
kpeter@765
   502
          }
kpeter@765
   503
        }
kpeter@765
   504
      }
kpeter@765
   505
      _process.swap(next);
kpeter@765
   506
    }
kpeter@765
   507
kpeter@765
   508
    // Process one round using _nodes instead of _process
kpeter@765
   509
    void processNextFullRound(int k) {
kpeter@765
   510
      Node u, v;
kpeter@765
   511
      Arc e;
kpeter@765
   512
      LargeValue d;
kpeter@765
   513
      for (int i = 0; i < int(_nodes->size()); ++i) {
kpeter@765
   514
        u = (*_nodes)[i];
kpeter@765
   515
        for (int j = 0; j < int(_out_arcs[u].size()); ++j) {
kpeter@765
   516
          e = _out_arcs[u][j];
kpeter@765
   517
          v = _gr.target(e);
kpeter@765
   518
          d = _data[u][k-1].dist + _length[e];
kpeter@765
   519
          if (!_data[v][k].found || _tolerance.less(d, _data[v][k].dist)) {
kpeter@765
   520
            _data[v][k] = PathData(true, d, e);
kpeter@765
   521
          }
kpeter@765
   522
        }
kpeter@765
   523
      }
kpeter@765
   524
    }
kpeter@765
   525
kpeter@765
   526
    // Update the minimum cycle mean
kpeter@765
   527
    void updateMinMean() {
kpeter@765
   528
      int n = _nodes->size();
kpeter@765
   529
      for (int i = 0; i < n; ++i) {
kpeter@765
   530
        Node u = (*_nodes)[i];
kpeter@765
   531
        if (!_data[u][n].found) continue;
kpeter@765
   532
        LargeValue length, max_length = 0;
kpeter@765
   533
        int size, max_size = 1;
kpeter@765
   534
        bool found_curr = false;
kpeter@765
   535
        for (int k = 0; k < n; ++k) {
kpeter@765
   536
          if (!_data[u][k].found) continue;
kpeter@765
   537
          length = _data[u][n].dist - _data[u][k].dist;
kpeter@765
   538
          size = n - k;
kpeter@765
   539
          if (!found_curr || length * max_size > max_length * size) {
kpeter@765
   540
            found_curr = true;
kpeter@765
   541
            max_length = length;
kpeter@765
   542
            max_size = size;
kpeter@765
   543
          }
kpeter@765
   544
        }
kpeter@765
   545
        if ( found_curr && (_cycle_node == INVALID ||
kpeter@765
   546
             max_length * _cycle_size < _cycle_length * max_size) ) {
kpeter@765
   547
          _cycle_length = max_length;
kpeter@765
   548
          _cycle_size = max_size;
kpeter@765
   549
          _cycle_node = u;
kpeter@765
   550
        }
kpeter@765
   551
      }
kpeter@765
   552
    }
kpeter@765
   553
kpeter@765
   554
  }; //class Karp
kpeter@765
   555
kpeter@765
   556
  ///@}
kpeter@765
   557
kpeter@765
   558
} //namespace lemon
kpeter@765
   559
kpeter@765
   560
#endif //LEMON_KARP_H