RhodeCode

  }

  /// @}

  /// \addtogroup graph_maps

  /// @{

  /// \brief Provides an immutable and unique id for each item in a graph.

  ///

  /// IdMap provides a unique and immutable id for each item of the

  /// same type (\c Node, \c Arc or \c Edge) in a graph. This id is 

  ///  - \b unique: different items get different ids,

  ///  - \b immutable: the id of an item does not change (even if you

  ///    delete other nodes).

  ///

  /// Using this map you get access (i.e. can read) the inner id values of

  /// the items stored in the graph, which is returned by the \c id()

  /// function of the graph. This map can be inverted with its member

  /// class \c InverseMap or with the \c operator() member.

  ///

  /// \tparam GR The graph type.

  /// \tparam K The key type of the map (\c GR::Node, \c GR::Arc or

  /// \c GR::Edge).

  ///

  template <typename GR, typename K>

  class IdMap : public MapBase<K, int> {

  public:

    /// The graph type of IdMap.

    typedef GR Graph;

    /// The key type of IdMap (\c Node, \c Arc or \c Edge).

    typedef K Item;

    /// The key type of IdMap (\c Node, \c Arc or \c Edge).

    typedef K Key;

    /// The value type of IdMap.

    typedef int Value;

    /// \brief Constructor.

    ///

    /// Constructor of the map.

    explicit IdMap(const Graph& graph) : _graph(&graph) {}

    /// \brief Gives back the \e id of the item.

    ///

    /// Gives back the immutable and unique \e id of the item.

    int operator[](const Item& item) const { return _graph->id(item);}

    /// \brief Gives back the \e item by its id.

    ///

      /// Constructor for creating an id-to-item map.

      explicit InverseMap(const Graph& graph) : _graph(&graph) {}

      /// \brief Constructor.

      ///

      /// Constructor for creating an id-to-item map.

      explicit InverseMap(const IdMap& map) : _graph(map._graph) {}

      /// \brief Gives back the given item from its id.

      ///

      /// Gives back the given item from its id.

      Item operator[](int id) const { return _graph->fromId(id, Item());}

    private:

      const Graph* _graph;

    };

    /// \brief Gives back the inverse of the map.

    ///

    /// Gives back the inverse of the IdMap.

    InverseMap inverse() const { return InverseMap(*_graph);}

  };

  /// This class provides simple invertable graph maps.

  /// It wraps an arbitrary \ref concepts::ReadWriteMap "ReadWriteMap"

  /// and if a key is set to a new value then store it

  /// in the inverse map.

  ///

  /// The values of the map can be accessed

  /// with stl compatible forward iterator.

  ///

  /// \tparam GR The graph type.

  /// \tparam K The key type of the map (\c GR::Node, \c GR::Arc or

  /// \c GR::Edge).

  /// \tparam V The value type of the map.

  ///

  /// \see IterableValueMap

  template <typename GR, typename K, typename V>

    : protected ItemSetTraits<GR, K>::template Map<V>::Type {

  private:

    typedef typename ItemSetTraits<GR, K>::

      template Map<V>::Type Map;

    typedef std::map<V, K> Container;

    Container _inv_map;

  public:

    typedef GR Graph;

    typedef K Item;

    typedef K Key;

    typedef V Value;

    /// \brief Constructor.

    ///

    /// \brief Forward iterator for values.

    ///

    /// This iterator is an stl compatible forward

    /// iterator on the values of the map. The values can

    /// be accessed in the <tt>[beginValue, endValue)</tt> range.

    class ValueIterator

      : public std::iterator<std::forward_iterator_tag, Value> {

    private:

      ValueIterator(typename Container::const_iterator _it)

        : it(_it) {}

    public:

      ValueIterator() {}

      ValueIterator& operator++() { ++it; return *this; }

      ValueIterator operator++(int) {

        ValueIterator tmp(*this);

        operator++();

        return tmp;

      }

      const Value& operator*() const { return it->first; }

      const Value* operator->() const { return &(it->first); }

      bool operator==(ValueIterator jt) const { return it == jt.it; }

      bool operator!=(ValueIterator jt) const { return it != jt.it; }

    private:

      typename Container::const_iterator it;

    };

      }

      Map::erase(keys);

    }

    /// \brief Clear the keys from the map and the inverse map.

    ///

    /// Clear the keys from the map and the inverse map. It is called by the

    /// \c AlterationNotifier.

    virtual void clear() {

      _inv_map.clear();

      Map::clear();

    }

  public:

    /// \brief The inverse map type.

    ///

    /// The inverse of this map. The subscript operator of the map

    /// gives back the item that was last assigned to the value.

    class InverseMap {

    public:

      /// \brief Constructor

      ///

      /// Constructor of the InverseMap.

        : _inverted(inverted) {}

      /// The value type of the InverseMap.

      /// The key type of the InverseMap.

      /// \brief Subscript operator.

      ///

      /// Subscript operator. It gives back the item

      /// that was last assigned to the given value.

      Value operator[](const Key& key) const {

        return _inverted(key);

      }

    private:

    };

    /// \brief It gives back the read-only inverse map.

    ///

    /// It gives back the read-only inverse map.

    InverseMap inverse() const {

      return InverseMap(*this);

    }

  };

  ///

  /// \c Edge) in a graph. This id is

  ///  - \b unique: different items get different ids,

  ///  - \b continuous: the range of the ids is the set of integers

  ///    between 0 and \c n-1, where \c n is the number of the items of

  ///

  /// Thus this id is not (necessarily) the same as what can get using

  /// the \c id() function of the graph or \ref IdMap.

  /// This map can be inverted with its member class \c InverseMap,

  /// or with the \c operator() member.

  ///

  /// \tparam GR The graph type.

  /// \tparam K The key type of the map (\c GR::Node, \c GR::Arc or

  /// \c GR::Edge).

  ///

  /// \see IdMap

  template <typename GR, typename K>

    : protected ItemSetTraits<GR, K>::template Map<int>::Type {

    typedef typename ItemSetTraits<GR, K>::template Map<int>::Type Map;

  public:

    typedef GR Graph;

    typedef K Item;

    typedef K Key;

    typedef int Value;

    /// \brief Constructor.

    ///

      Item it;

      const typename Map::Notifier* nf = Map::notifier();

      for (nf->first(it); it != INVALID; nf->next(it)) {

        Map::set(it, _inv_map.size());

        _inv_map.push_back(it);

      }

    }

  protected:

    /// \brief Adds a new key to the map.

    ///

    /// Add a new key to the map. It is called by the

    /// \c AlterationNotifier.

    virtual void add(const Item& item) {

      Map::add(item);

      Map::set(item, _inv_map.size());

      _inv_map.push_back(item);

    }

    /// \brief Add more new keys to the map.

    ///

    /// Add more new keys to the map. It is called by the

    /// \c AlterationNotifier.

      Map::clear();

    }

  public:

    /// \brief Returns the maximal value plus one.

    ///

    /// Returns the maximal value plus one in the map.

    unsigned int size() const {

      return _inv_map.size();

    }

    /// \brief Swaps the position of the two items in the map.

    ///

    /// Swaps the position of the two items in the map.

    void swap(const Item& p, const Item& q) {

      int pi = Map::operator[](p);

      int qi = Map::operator[](q);

      Map::set(p, qi);

      _inv_map[qi] = p;

      Map::set(q, pi);

      _inv_map[pi] = q;

    }

    ///

    int operator[](const Item& item) const {

      return Map::operator[](item);

    }

    ///

    Item operator()(int id) const {

      return _inv_map[id];

    }

  private:

    typedef std::vector<Item> Container;

    Container _inv_map;

  public:

    ///

    class InverseMap {

    public:

      /// \brief Constructor

      ///

      /// Constructor of the InverseMap.

        : _inverted(inverted) {}

      /// The value type of the InverseMap.

      /// The key type of the InverseMap.

      /// \brief Subscript operator.

      ///

      /// Subscript operator. It gives back the item

      /// that the descriptor currently belongs to.

      Value operator[](const Key& key) const {

        return _inverted(key);

      }

      /// \brief Size of the map.

      ///

      /// Returns the size of the map.

      unsigned int size() const {

        return _inverted.size();

      }

    private:

    };

    /// \brief Gives back the inverse of the map.

    ///

    /// Gives back the inverse of the map.

    const InverseMap inverse() const {

      return InverseMap(*this);

    }

  };

  /// \brief Map of the source nodes of arcs in a digraph.

  ///

  /// SourceMap provides access for the source node of each arc in a digraph,

  /// which is returned by the \c source() function of the digraph.

  /// \tparam GR The digraph type.

  /// \see TargetMap

  template <typename GR>

  class SourceMap {

  public:

    ///\e

    typedef typename GR::Arc Key;

    ///\e

    typedef typename GR::Node Value;

 */

#include <cstdlib>

#include <ctime>

#include <lemon/random.h>

#include <lemon/list_graph.h>

#include <lemon/smart_graph.h>

#include <lemon/maps.h>

#include "graph_test.h"

#include "test_tools.h"

using namespace lemon;

template <typename Digraph>

void checkFindArcs() {

  TEMPLATE_DIGRAPH_TYPEDEFS(Digraph);

  {

    Digraph digraph;

    for (int i = 0; i < 10; ++i) {

      digraph.addNode();

    }

    for (int i = 0; i < 100; ++i) {

      int src = rnd[invNodes.size()];

      int trg = rnd[invNodes.size()];

      digraph.addArc(invNodes[src], invNodes[trg]);

    }

    typename Digraph::template ArcMap<bool> found(digraph, false);

    for (NodeIt src(digraph); src != INVALID; ++src) {

      for (NodeIt trg(digraph); trg != INVALID; ++trg) {

        for (ConArcIt<Digraph> con(digraph, src, trg); con != INVALID; ++con) {

          check(digraph.source(con) == src, "Wrong source.");

          check(digraph.target(con) == trg, "Wrong target.");

          check(found[con] == false, "The arc found already.");

          found[con] = true;

        }

      }

    }

    for (ArcIt it(digraph); it != INVALID; ++it) {

      check(found[it] == true, "The arc is not found.");

    }

  }

  {

    int num = 5;

    Digraph fg;

    std::vector<Node> nodes;

    for (int i = 0; i < num; ++i) {

      nodes.push_back(fg.addNode());

    }

    for (int i = 0; i < num * num; ++i) {

      fg.addArc(nodes[i / num], nodes[i % num]);

        Arc con2 = al2(src, trg);

        Arc con3 = al3(src, trg);

        Arc con4 = findArc(fg, src, trg);

        check(con1 == con2 && con2 == con3 && con3 == con4,

              "Different results.")

        check(con1 != INVALID, "There is no connecting arc.");

        check(fg.source(con1) == src, "Wrong source.");

        check(fg.target(con1) == trg, "Wrong target.");

        check(al3(src, trg, con3) == INVALID,

              "There is more connecting arc.");

        check(findArc(fg, src, trg, con4) == INVALID,

              "There is more connecting arc.");

      }

    }

  }

}

template <typename Graph>

void checkFindEdges() {

  TEMPLATE_GRAPH_TYPEDEFS(Graph);

  Graph graph;

  for (int i = 0; i < 10; ++i) {

    graph.addNode();

  }

  for (int i = 0; i < 100; ++i) {

    int src = rnd[invNodes.size()];

    int trg = rnd[invNodes.size()];

    graph.addEdge(invNodes[src], invNodes[trg]);

  }

  typename Graph::template EdgeMap<int> found(graph, 0);

  for (NodeIt src(graph); src != INVALID; ++src) {

    for (NodeIt trg(graph); trg != INVALID; ++trg) {

      for (ConEdgeIt<Graph> con(graph, src, trg); con != INVALID; ++con) {

        check( (graph.u(con) == src && graph.v(con) == trg) ||

               (graph.v(con) == src && graph.u(con) == trg),

               "Wrong end nodes.");

        ++found[con];

        check(found[con] <= 2, "The edge found more than twice.");

      }

    }

  }

  for (EdgeIt it(graph); it != INVALID; ++it) {

    check( (graph.u(it) != graph.v(it) && found[it] == 2) ||

           (graph.u(it) == graph.v(it) && found[it] == 1),

           "The edge is not found correctly.");

  }

}

template <class Digraph>

void checkDeg()

{

  TEMPLATE_DIGRAPH_TYPEDEFS(Digraph);

  const int nodeNum = 10;