RhodeCode

 * provided that this copyright notice appears in all copies. For

 * 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_CONCEPT_MAPS_H

#define LEMON_CONCEPT_MAPS_H

#include <lemon/bits/utility.h>

#include <lemon/concept_check.h>

///\ingroup concept

///\file

///\brief Map concepts checking classes for testing and documenting.

namespace lemon {

  namespace concepts {

    /// \addtogroup concept

    /// @{

    /// Readable map concept

    /// Readable map concept.

    ///

    template<typename K, typename T>

    class ReadMap

    {

    public:

      /// The key type of the map.

      typedef K Key;    

      /// The value type of the map. (The type of objects associated with the keys).

      typedef T Value;

      /// Returns the value associated with a key.

      /// Returns the value associated with a key.

      /// \bug Value shouldn't need to be default constructible.

      ///

      Value operator[](const Key &) const {return Value();}

      template<typename _ReadMap>

      struct Constraints {

	void constraints() {

	  Value val = m[key];

	  val = m[key];

	  typename _ReadMap::Value own_val = m[own_key]; 

	  own_val = m[own_key]; 

	  ignore_unused_variable_warning(val);

	  ignore_unused_variable_warning(own_val);

	  ignore_unused_variable_warning(key);

	}

	Key& key;

	typename _ReadMap::Key& own_key;

	_ReadMap& m;

      };

    };

    /// Writable map concept

    /// Writable map concept.

    ///

    template<typename K, typename T>

    class WriteMap

    {

    public:

      /// The key type of the map.

      typedef K Key;    

      /// The value type of the map. (The type of objects associated with the keys).

      typedef T Value;

      /// Sets the value associated with a key.

      void set(const Key &,const Value &) {}

      ///Default constructor

      WriteMap() {}

      template <typename _WriteMap>

      struct Constraints {

	void constraints() {

	  // No constraints for constructor.

	  m.set(key, val);

	  m.set(own_key, own_val);

	  ignore_unused_variable_warning(key);

	  ignore_unused_variable_warning(val);

	  ignore_unused_variable_warning(own_key);

	  ignore_unused_variable_warning(own_val);

	}

      /// Returns the value associated with a key.

      Value operator[](const Key &) const {return Value();}

      /// Sets the value associated with a key.

      void set(const Key & ,const Value &) {}

      template<typename _ReadWriteMap>

      struct Constraints {

	void constraints() {

	  checkConcept<ReadMap<K, T>, _ReadWriteMap >();

	  checkConcept<WriteMap<K, T>, _ReadWriteMap >();

	}

      };

    };

    /// Dereferable map concept

    /// Dereferable map concept.

    ///

    /// \todo Rethink this concept.

    template<typename K, typename T, typename R, typename CR>

    class ReferenceMap : public ReadWriteMap<K,T>

    {

    public:

      /// Tag for reference maps.

      typedef True ReferenceMapTag;

      /// The key type of the map.

      typedef K Key;    

      /// The value type of the map. (The type of objects associated with the keys).

      typedef T Value;

      /// The reference type of the map.

      typedef R Reference;

      /// The const reference type of the map.

      typedef CR ConstReference;

    protected:

      Value tmp;

    public:

      ///Returns a reference to the value associated with a key.

      Reference operator[](const Key &) { return tmp; }

      ///Returns a const reference to the value associated with a key.

      ConstReference operator[](const Key &) const { return tmp; }

      /// Sets the value associated with a key.

      void set(const Key &k,const Value &t) { operator[](k)=t; }

      template<typename _ReferenceMap>

	void constraints() {

	  m[key] = val;

	  val  = m[key];

	  m[key] = ref;

	  ref = m[key];

	  m[own_key] = own_val;

	  own_val  = m[own_key];

	  m[own_key] = own_ref;

	  own_ref = m[own_key];	  	  

	}

	typename _ReferenceMap::Key& own_key;

	typename _ReferenceMap::Value& own_val;

	Key& key;

	Value& val;

	_ReferenceMap& m;

      };

    };

    // @}

  } //namespace concepts

} //namespace lemon

#endif // LEMON_CONCEPT_MAPS_H

      explicit Node(int pid) { id = pid;}

    public:

      Node() {}

      Node (Invalid) { id = -1; }

      bool operator==(const Node& node) const {return id == node.id;}

      bool operator!=(const Node& node) const {return id != node.id;}

      bool operator<(const Node& node) const {return id < node.id;}

    };

    class Arc {

      friend class ListDigraphBase;

    protected:

      int id;

      explicit Arc(int pid) { id = pid;}

    public:

      Arc() {}

      Arc (Invalid) { id = -1; }

      bool operator==(const Arc& arc) const {return id == arc.id;}

      bool operator!=(const Arc& arc) const {return id != arc.id;}

      bool operator<(const Arc& arc) const {return id < arc.id;}

    };

    ListDigraphBase()

      : nodes(), first_node(-1),

	first_free_node(-1), arcs(), first_free_arc(-1) {}

    int maxNodeId() const { return nodes.size()-1; } 

    int maxArcId() const { return arcs.size()-1; }

    Node source(Arc e) const { return Node(arcs[e.id].source); }

    Node target(Arc e) const { return Node(arcs[e.id].target); }

    void first(Node& node) const { 

      node.id = first_node;

    }

    void next(Node& node) const {

      node.id = nodes[node.id].next;

    }

      int n;

      for(n = first_node; 

	  n!=-1 && nodes[n].first_in == -1; 

	  n = nodes[n].next);

    }

    void next(Arc& arc) const {

      if (arcs[arc.id].next_in != -1) {

	arc.id = arcs[arc.id].next_in;

      } else {

	int n;

	for(n = nodes[arcs[arc.id].target].next;

	  n!=-1 && nodes[n].first_in == -1; 

	  n = nodes[n].next);

	arc.id = (n == -1) ? -1 : nodes[n].first_in;

      }      

    }

    void firstOut(Arc &e, const Node& v) const {

      e.id = nodes[v.id].first_out;

    }

    void nextOut(Arc &e) const {

      e.id=arcs[e.id].next_out;

    }

    void firstIn(Arc &e, const Node& v) const {

      e.id = nodes[v.id].first_in;

    }

    void nextIn(Arc &e) const {

      e.id=arcs[e.id].next_in;

    }

    static int id(Node v) { return v.id; }

    static int id(Arc e) { return e.id; }

    static Node nodeFromId(int id) { return Node(id);}

    static Arc arcFromId(int id) { return Arc(id);}

    Node addNode() {     

      int n;

      if(first_free_node==-1) {

	n = nodes.size();

	nodes.push_back(NodeT());

      } else {

	n = first_free_node;

	first_free_node = nodes[n].next;

      }

      nodes[n].next = first_node;

      if(first_node != -1) nodes[first_node].prev = n;

      arcs[n].next_in = first_free_arc;

      first_free_arc = n;      

    }

    void clear() {

      arcs.clear();

      nodes.clear();

      first_node = first_free_node = first_free_arc = -1;

    }

  protected:

    void changeTarget(Arc e, Node n) 

    {

      if(arcs[e.id].next_in != -1)

	arcs[arcs[e.id].next_in].prev_in = arcs[e.id].prev_in;

      if(arcs[e.id].prev_in != -1)

	arcs[arcs[e.id].prev_in].next_in = arcs[e.id].next_in;

      else nodes[arcs[e.id].target].first_in = arcs[e.id].next_in;

      if (nodes[n.id].first_in != -1) {

	arcs[nodes[n.id].first_in].prev_in = e.id;

      }

      arcs[e.id].target = n.id;

      arcs[e.id].prev_in = -1;

      arcs[e.id].next_in = nodes[n.id].first_in;

      nodes[n.id].first_in = e.id;

    }

    void changeSource(Arc e, Node n) 

    {

      if(arcs[e.id].next_out != -1)

	arcs[arcs[e.id].next_out].prev_out = arcs[e.id].prev_out;

      if(arcs[e.id].prev_out != -1)

	arcs[arcs[e.id].prev_out].next_out = arcs[e.id].next_out;

      else nodes[arcs[e.id].source].first_out = arcs[e.id].next_out;

      if (nodes[n.id].first_out != -1) {

	arcs[nodes[n.id].first_out].prev_out = e.id;

      }

      arcs[e.id].source = n.id;

      arcs[e.id].prev_out = -1;

      arcs[e.id].next_out = nodes[n.id].first_out;

      nodes[n.id].first_out = e.id;

    }

  };

  typedef DigraphExtender<ListDigraphBase> ExtendedListDigraphBase;

  /// @{

  ///

  ///It conforms to the \ref concepts::Digraph "Digraph concept" and it

  ///

  ///An important extra feature of this digraph implementation is that

  ///its maps are real \ref concepts::ReferenceMap "reference map"s.

  ///

  class ListDigraph : public ExtendedListDigraphBase {

  private:

    ///

    ListDigraph(const ListDigraph &) :ExtendedListDigraphBase() {};

    ///\brief Assignment of ListDigraph to another one is \e not allowed.

    ///Assignment of ListDigraph to another one is \e not allowed.

    void operator=(const ListDigraph &) {}

  public:

    typedef ExtendedListDigraphBase Parent;

    /// Constructor

    /// Constructor.

    ///

    ListDigraph() {}

    ///Add a new node to the digraph.

    Node addNode() { return Parent::addNode(); }

    ///Add a new arc to the digraph.

    ///Add a new arc to the digraph with source node \c s

    ///and target node \c t.

    ///\return the new arc.

    Arc addArc(const Node& s, const Node& t) { 

      return Parent::addArc(s, t); 

    }

    ///

    ///\note The <tt>ArcIt</tt>s and <tt>OutArcIt</tt>s referencing

    ///the changed arc remain valid. However <tt>InArcIt</tt>s are

    ///invalidated.

    ///\warning This functionality cannot be used together with the Snapshot

    ///feature.

    void changeTarget(Arc e, Node n) { 

      Parent::changeTarget(e,n); 

    }

    ///

    ///\note The <tt>ArcIt</tt>s and <tt>InArcIt</tt>s referencing

    ///the changed arc remain valid. However <tt>OutArcIt</tt>s are

    ///invalidated.

    ///\warning This functionality cannot be used together with the Snapshot

    ///feature.

    void changeSource(Arc e, Node n) { 

      Parent::changeSource(e,n);

    }

    /// Invert the direction of an arc.

    ///\note The <tt>ArcIt</tt>s referencing the changed arc remain

    ///valid. However <tt>OutArcIt</tt>s and <tt>InArcIt</tt>s are

    ///invalidated.

    ///\warning This functionality cannot be used together with the Snapshot

    ///feature.

    void reverseArc(Arc e) {

      Node t=target(e);

      changeTarget(e,source(e));

      changeSource(e,t);

    }

    /// allocation: if you know that the digraph you want to build will

    /// be very large (e.g. it will contain millions of nodes and/or arcs)

    /// then it is worth reserving space for this amount before starting

    /// to build the digraph.

    /// \sa reserveArc

    void reserveNode(int n) { nodes.reserve(n); };

    /// allocation: if you know that the digraph you want to build will

    /// be very large (e.g. it will contain millions of nodes and/or arcs)

    /// then it is worth reserving space for this amount before starting

    /// to build the digraph.

    /// \sa reserveNode

    void reserveArc(int m) { arcs.reserve(m); };

    ///Contract two nodes.

    ///This function contracts two nodes.

    ///Node \p b will be removed but instead of deleting

    ///incident arcs, they will be joined to \p a.

    ///The last parameter \p r controls whether to remove loops. \c true

    ///means that loops will be removed.

    ///

    ///valid. However <tt>InArcIt</tt>s and <tt>OutArcIt</tt>s

    ///may be invalidated.

    ///\warning This functionality cannot be used together with the Snapshot

    ///feature.

    void contract(Node a, Node b, bool r = true) 

    {

      for(OutArcIt e(*this,b);e!=INVALID;) {

	OutArcIt f=e;

	++f;

	if(r && target(e)==a) erase(e);

	else changeSource(e,a);

	e=f;

      }

      for(InArcIt e(*this,b);e!=INVALID;) {

	InArcIt f=e;

	++f;

	if(r && source(e)==a) erase(e);

	else changeTarget(e,a);

	e=f;

      }

      erase(b);

    }

    ///Split a node.

    ///This function splits a node. First a new node is added to the digraph,

    ///then the source of each outgoing arc of \c n is moved to this new node.

    ///If \c connect is \c true (this is the default value), then a new arc

    ///from \c n to the newly created node is also added.

    ///\return The newly created node.

    ///

    ///\note The <tt>ArcIt</tt>s referencing a moved arc remain

    ///valid. However <tt>InArcIt</tt>s and <tt>OutArcIt</tt>s may

    ///be invalidated.  

    ///

    ///\warning This functionality cannot be used together with the

    Node split(Node n, bool connect = true) {

      Node b = addNode();

      for(OutArcIt e(*this,n);e!=INVALID;) {

 	OutArcIt f=e;

	++f;

	changeSource(e,b);

	e=f;

      }

      if (connect) addArc(n,b);

      return b;

    }

    ///Split an arc.

    ///This function splits an arc. First a new node \c b is added to

    ///the digraph, then the original arc is re-targeted to \c

    ///b. Finally an arc from \c b to the original target is added.

    Node split(Arc e) {

      Node b = addNode();

      addArc(b,target(e));

      changeTarget(e,b);

      return b;

    }

    /// \brief Class to make a snapshot of the digraph and restore

    ///

    ///

    /// The newly added nodes and arcs can be removed using the

    /// restore() function.

    ///

    class Snapshot {

    protected:

      typedef Parent::NodeNotifier NodeNotifier;

      class NodeObserverProxy : public NodeNotifier::ObserverBase {

      public:

        NodeObserverProxy(Snapshot& _snapshot)

          : snapshot(_snapshot) {}

        using NodeNotifier::ObserverBase::attach;

        using NodeNotifier::ObserverBase::detach;

        using NodeNotifier::ObserverBase::attached;

      protected:

        virtual void add(const Node& node) {

          snapshot.addNode(node);

        }

        virtual void add(const std::vector<Node>& nodes) {

          for (int i = nodes.size() - 1; i >= 0; ++i) {

            snapshot.addNode(nodes[i]);

          }

        }

        virtual void erase(const Node& node) {

          snapshot.eraseNode(node);

        }

        virtual void erase(const std::vector<Node>& nodes) {

          for (int i = 0; i < int(nodes.size()); ++i) {

            snapshot.eraseNode(nodes[i]);

          }

        }

        virtual void build() {

          Node node;

          std::vector<Node> nodes;

          for (notifier()->first(node); node != INVALID; 

               notifier()->next(node)) {

            nodes.push_back(node);

          }

          for (int i = nodes.size() - 1; i >= 0; --i) {

            snapshot.addNode(nodes[i]);

          }

        }

        virtual void clear() {

          Node node;

          for (notifier()->first(node); node != INVALID; 

               notifier()->next(node)) {

    struct ArcT {

      int target;

      int prev_out, next_out;

    };

    std::vector<NodeT> nodes;

    int first_node;

    int first_free_node;

    std::vector<ArcT> arcs;

    int first_free_arc;

  public:

    typedef ListGraphBase Digraph;

    class Node;

    class Arc;

    class Edge;

    class Node {

      friend class ListGraphBase;

    protected:

      int id;

      explicit Node(int pid) { id = pid;}

    public:

      Node() {}

      Node (Invalid) { id = -1; }

      bool operator==(const Node& node) const {return id == node.id;}

      bool operator!=(const Node& node) const {return id != node.id;}

      bool operator<(const Node& node) const {return id < node.id;}

    };

    class Edge {

      friend class ListGraphBase;

    protected:

      int id;

      explicit Edge(int pid) { id = pid;}

    public:

      Edge() {}

      Edge (Invalid) { id = -1; }

    };

    class Arc {

      friend class ListGraphBase;

    protected:

      int id;

      explicit Arc(int pid) { id = pid;}

    public:

      operator Edge() const { return edgeFromId(id / 2); }

      Arc() {}

      Arc (Invalid) { id = -1; }

      bool operator==(const Arc& arc) const {return id == arc.id;}

      bool operator!=(const Arc& arc) const {return id != arc.id;}

      bool operator<(const Arc& arc) const {return id < arc.id;}

    };

    ListGraphBase()

      : nodes(), first_node(-1),

	first_free_node(-1), arcs(), first_free_arc(-1) {}

    int maxNodeId() const { return nodes.size()-1; } 

    int maxEdgeId() const { return arcs.size() / 2 - 1; }

    int maxArcId() const { return arcs.size()-1; }

    Node source(Arc e) const { return Node(arcs[e.id ^ 1].target); }

    Node target(Arc e) const { return Node(arcs[e.id].target); }

    Node u(Edge e) const { return Node(arcs[2 * e.id].target); }

    Node v(Edge e) const { return Node(arcs[2 * e.id + 1].target); }

    static bool direction(Arc e) {

      return (e.id & 1) == 1;

    }

    static Arc direct(Edge e, bool d) {

      return Arc(e.id * 2 + (d ? 1 : 0));

    }

    void first(Node& node) const { 

      node.id = first_node;

    }

        } 

        n = nodes[n].next;

      }

      e.id = -1;

    }

    void next(Edge& e) const {

      int n = arcs[e.id * 2].target;

      e.id = arcs[(e.id * 2) | 1].next_out;

      while ((e.id & 1) != 1) {

        e.id = arcs[e.id].next_out;

      }

      if (e.id != -1) {

        e.id /= 2;

        return;

      } 

      n = nodes[n].next;

      while (n != -1) {

        e.id = nodes[n].first_out;

        while ((e.id & 1) != 1) {

          e.id = arcs[e.id].next_out;

        }

        if (e.id != -1) {

          e.id /= 2;

          return;

        } 

        n = nodes[n].next;

      }

      e.id = -1;

    }

    void firstOut(Arc &e, const Node& v) const {

      e.id = nodes[v.id].first_out;

    }

    void nextOut(Arc &e) const {

      e.id = arcs[e.id].next_out;

    }

    void firstIn(Arc &e, const Node& v) const {

      e.id = ((nodes[v.id].first_out) ^ 1);

      if (e.id == -2) e.id = -1;

    }

    void nextIn(Arc &e) const {

      e.id = ((arcs[e.id ^ 1].next_out) ^ 1);

      if (e.id == -2) e.id = -1;

    }

    void firstInc(Edge &e, bool& d, const Node& v) const {

      } else {

        e.id = -1;

        d = true;

      }

    }

    void nextInc(Edge &e, bool& d) const {

      } else {

        e.id = -1;

        d = true;

      }

    }

    static int id(Node v) { return v.id; }

    static int id(Arc e) { return e.id; }

    static int id(Edge e) { return e.id; }

    static Node nodeFromId(int id) { return Node(id);}

    static Arc arcFromId(int id) { return Arc(id);}

    static Edge edgeFromId(int id) { return Edge(id);}

    Node addNode() {     

      int n;

      if(first_free_node==-1) {

	n = nodes.size();

	nodes.push_back(NodeT());

      } else {

	n = first_free_node;

	first_free_node = nodes[n].next;

      }

      nodes[n].next = first_node;

      if (first_node != -1) nodes[first_node].prev = n;

      first_node = n;

      nodes[n].prev = -1;

      nodes[n].first_out = -1;

      return Node(n);

    }

    Edge addEdge(Node u, Node v) {

      int n;      

      if (first_free_arc == -1) {

	n = arcs.size();

	arcs.push_back(ArcT());

	arcs.push_back(ArcT());

      } else {

	n = first_free_arc;

	first_free_arc = arcs[n].next_out;

      }

      arcs[n].target = u.id;

      arcs[n | 1].target = v.id;

      arcs[n].next_out = nodes[v.id].first_out;

      if (nodes[v.id].first_out != -1) {

	arcs[nodes[v.id].first_out].prev_out = n;

      }      

      arcs[n].prev_out = -1;

      nodes[v.id].first_out = n;

      arcs[n | 1].next_out = nodes[u.id].first_out;

      if (nodes[u.id].first_out != -1) {

	arcs[nodes[u.id].first_out].prev_out = (n | 1);

      }

      arcs[n | 1].prev_out = -1;      

      nodes[u.id].first_out = (n | 1);

      return Edge(n / 2);

    }

    void erase(const Node& node) {

      int n = node.id;

      if(nodes[n].next != -1) {

	nodes[nodes[n].next].prev = nodes[n].prev;

      }

      if(nodes[n].prev != -1) {

	nodes[nodes[n].prev].next = nodes[n].next;

      } else {

	first_node = nodes[n].next;

      }

      nodes[n].next = first_free_node;

      first_free_node = n;

    }

      if (arcs[n].next_out != -1) {

	arcs[arcs[n].next_out].prev_out = arcs[n].prev_out;

      } 

      if (arcs[n].prev_out != -1) {

	arcs[arcs[n].prev_out].next_out = arcs[n].next_out;

      } else {

	nodes[arcs[n | 1].target].first_out = arcs[n].next_out;

      }

      if (arcs[n | 1].next_out != -1) {

	arcs[arcs[n | 1].next_out].prev_out = arcs[n | 1].prev_out;

      } 

      if (arcs[n | 1].prev_out != -1) {

	arcs[arcs[n | 1].prev_out].next_out = arcs[n | 1].next_out;

      } else {

	nodes[arcs[n].target].first_out = arcs[n | 1].next_out;

      }

      arcs[n].next_out = first_free_arc;

      first_free_arc = n;      

    }

    void clear() {

      arcs.clear();

      nodes.clear();

      first_node = first_free_node = first_free_arc = -1;

    }

  protected:

    void changeTarget(Edge e, Node n) {

      if(arcs[2 * e.id].next_out != -1) {

	arcs[arcs[2 * e.id].next_out].prev_out = arcs[2 * e.id].prev_out;

      }

      if(arcs[2 * e.id].prev_out != -1) {

	arcs[arcs[2 * e.id].prev_out].next_out = 

          arcs[2 * e.id].next_out;

      } else {

        nodes[arcs[(2 * e.id) | 1].target].first_out = 

          arcs[2 * e.id].next_out;

      }

      if (nodes[n.id].first_out != -1) {

	arcs[nodes[n.id].first_out].prev_out = 2 * e.id;

      }

      arcs[(2 * e.id) | 1].target = n.id;

      arcs[2 * e.id].prev_out = -1;

      arcs[2 * e.id].next_out = nodes[n.id].first_out;

      nodes[n.id].first_out = 2 * e.id;

    }

    void changeSource(Edge e, Node n) {

      if(arcs[(2 * e.id) | 1].next_out != -1) {

	arcs[arcs[(2 * e.id) | 1].next_out].prev_out = 

          arcs[(2 * e.id) | 1].prev_out;

      }

      if(arcs[(2 * e.id) | 1].prev_out != -1) {

	arcs[arcs[(2 * e.id) | 1].prev_out].next_out = 

          arcs[(2 * e.id) | 1].next_out;

      } else {

        nodes[arcs[2 * e.id].target].first_out = 

          arcs[(2 * e.id) | 1].next_out;

      }

      if (nodes[n.id].first_out != -1) {

	arcs[nodes[n.id].first_out].prev_out = ((2 * e.id) | 1);

      }

      arcs[2 * e.id].target = n.id;

      arcs[(2 * e.id) | 1].prev_out = -1;

      arcs[(2 * e.id) | 1].next_out = nodes[n.id].first_out;

      nodes[n.id].first_out = ((2 * e.id) | 1);

    }

  };

  typedef GraphExtender<ListGraphBase> ExtendedListGraphBase;

  /// @{

  ///

  ///its maps are real \ref concepts::ReferenceMap "reference map"s.

  ///

  class ListGraph : public ExtendedListGraphBase {

  private:

    ///

    ListGraph(const ListGraph &) :ExtendedListGraphBase()  {};

    ///\brief Assignment of ListGraph to another one is \e not allowed.

    ///Assignment of ListGraph to another one is \e not allowed.

    void operator=(const ListGraph &) {}

  public:

    /// Constructor

    /// Constructor.

    ///

    ListGraph() {}

    typedef ExtendedListGraphBase Parent;

    ///

    /// \return the new node.

    Node addNode() { return Parent::addNode(); }

    ///

    /// and target node \c t.

    /// \return the new edge.

    Edge addEdge(const Node& s, const Node& t) { 

      return Parent::addEdge(s, t); 

    }

    ///

    ///

    ///\note The <tt>ArcIt</tt>s and <tt>InArcIt</tt>s

    ///referencing the changed arc remain

    ///valid. However <tt>OutArcIt</tt>s are invalidated.

    void changeSource(Edge e, Node n) { 

      Parent::changeSource(e,n); 

    }    

    ///

    ///

    /// \note The <tt>ArcIt</tt>s referencing the changed arc remain

    /// valid. However the other iterators may be invalidated.

    void changeTarget(Edge e, Node n) { 

      Parent::changeTarget(e,n); 

    }

    ///

    ///

    ///\note The <tt>ArcIt</tt>s and <tt>InArcIt</tt>s

    ///referencing the changed arc remain

    ///valid. However <tt>OutArcIt</tt>s are invalidated.

    void changeSource(Arc e, Node n) { 

      if (Parent::direction(e)) {

        Parent::changeSource(e,n);

      } else {