RhodeCode

 * precise terms see the accompanying LICENSE file.

 *

 * This software is provided "AS IS" with no warranty of any kind,

 * express or implied, and with no claim as to its suitability for any

 * purpose.

 *

 */

#ifndef LEMON_KRUSKAL_H

#define LEMON_KRUSKAL_H

#include <algorithm>

#include <vector>

#include <lemon/unionfind.h>

// #include <lemon/graph_utils.h>

#include <lemon/maps.h>

// #include <lemon/radix_sort.h>

#include <lemon/bits/utility.h>

#include <lemon/bits/traits.h>

///\ingroup spantree

///\file

///

///

namespace lemon {

  namespace _kruskal_bits {

    // Kruskal for directed graphs.

    template <typename Digraph, typename In, typename Out>

    typename disable_if<lemon::UndirectedTagIndicator<Digraph>,

		       typename In::value_type::second_type >::type

    kruskal(const Digraph& digraph, const In& in, Out& out,dummy<0> = 0) {

      typedef typename In::value_type::second_type Value;

      typedef typename Digraph::template NodeMap<int> IndexMap;

      typedef typename Digraph::Node Node;

      IndexMap index(digraph);

      UnionFind<IndexMap> uf(index);

      for (typename Digraph::NodeIt it(digraph); it != INVALID; ++it) {

        uf.insert(it);

      }

      Value tree_value = 0;

      for (typename In::const_iterator it = in.begin(); it != in.end(); ++it) {

      static Value kruskal(const Graph& graph, const In& in, Out& out) {

        typedef LoggerBoolMap<typename RemoveConst<Out>::type> Map;

        Map map(out);

        return _kruskal_bits::kruskal(graph, in, map);

      }

    };

    template <typename Graph, typename In, typename Out>

    struct KruskalOutputSelector<Graph, In, Out,

      typename enable_if<MapOutputIndicator<Out>, void>::type > 

    {

      typedef typename In::value_type::second_type Value;

      static Value kruskal(const Graph& graph, const In& in, Out& out) {

        return _kruskal_bits::kruskal(graph, in, out);

      }

    };

  }

  /// \ingroup spantree

  ///

  ///

  /// Due to some C++ hacking, it accepts various input and output types.

  ///

  /// \param g The graph the algorithm runs on.

  /// It can be either \ref concepts::Digraph "directed" or 

  /// \ref concepts::Graph "undirected".

  /// If the graph is directed, the algorithm consider it to be 

  /// undirected by disregarding the direction of the arcs.

  ///

  /// - An STL compatible 'Forward Container' with

  /// along with the assigned cost. <em>They must be in a

  /// cost-ascending order.</em>

  ///

  /// to the tree, otherwise it will be set to \c false. The value of

  /// - It can also be an iteraror of an STL Container with

  /// <tt>value_type</tt>.  The algorithm copies the elements of the

  /// found tree into this sequence.  For example, if we know that the

  /// spanning tree of the graph \c g has say 53 arcs, then we can

  /// put its arcs into an STL vector \c tree with a code like this.

  ///\code

  /// std::vector<Arc> tree(53);

  /// kruskal(g,cost,tree.begin());

  ///\endcode

  /// Or if we don't know in advance the size of the tree, we can

  /// write this.  

  /// kruskal(g,cost,std::back_inserter(tree)); 

  ///\endcode

  ///

  ///

  /// Arc type for input and output.

  ///

#ifdef DOXYGEN

  template <class Graph, class In, class Out>

  Value kruskal(GR const& g, const In& in, Out& out)

#else 

  template <class Graph, class In, class Out>

  inline typename _kruskal_bits::KruskalValueSelector<In>::Value 

  kruskal(const Graph& graph, const In& in, Out& out) 

#endif

  {

    return _kruskal_bits::KruskalInputSelector<Graph, In, Out>::

      kruskal(graph, in, out);

  }

  template <class Graph, class In, class Out>

  inline typename _kruskal_bits::KruskalValueSelector<In>::Value

  kruskal(const Graph& graph, const In& in, const Out& out)

  {

    return _kruskal_bits::KruskalInputSelector<Graph, In, const Out>::