RhodeCode

      } 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 changeU(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;

  /// \addtogroup graphs

  /// @{

  ///A general undirected graph structure.

  ///\ref ListGraph is a versatile and fast undirected graph

  ///implementation based on linked lists that are stored in

  ///\c std::vector structures.

  ///

  ///This type fully conforms to the \ref concepts::Graph "Graph concept"

  ///and it also provides several useful additional functionalities.

  ///Most of its member functions and nested classes are documented

  ///only in the concept class.

  ///

  ///\sa concepts::Graph

  ///\sa ListDigraph

  class ListGraph : public ExtendedListGraphBase {

    typedef ExtendedListGraphBase Parent;

  private:

    /// Graphs are \e not copy constructible. Use GraphCopy instead.

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

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

    /// Use GraphCopy instead.

    void operator=(const ListGraph &) {}

  public:

    /// Constructor

    /// Constructor.

    ///

    ListGraph() {}

    typedef Parent::OutArcIt IncEdgeIt;

    /// \brief Add a new node to the graph.

    ///

    /// This function adds a new node to the graph.

    /// \return The new node.

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

    /// \brief Add a new edge to the graph.

    ///

    /// This function adds a new edge to the graph between nodes

    /// \c u and \c v with inherent orientation from node \c u to

    /// node \c v.

    /// \return The new edge.

    Edge addEdge(Node u, Node v) {

      return Parent::addEdge(u, v);

    }

    ///\brief Erase a node from the graph.

    ///

    /// This function erases the given node from the graph.

    void erase(Node n) { Parent::erase(n); }

    ///\brief Erase an edge from the graph.

    ///

    /// This function erases the given edge from the graph.

    void erase(Edge e) { Parent::erase(e); }

    /// Node validity check

    /// This function gives back \c true if the given node is valid,

    /// i.e. it is a real node of the graph.

    ///

    /// \warning A removed node could become valid again if new nodes are

    /// added to the graph.

    bool valid(Node n) const { return Parent::valid(n); }

    /// Edge validity check

    /// This function gives back \c true if the given edge is valid,

    /// i.e. it is a real edge of the graph.

    ///

    /// \warning A removed edge could become valid again if new edges are

    /// added to the graph.

    bool valid(Edge e) const { return Parent::valid(e); }

    /// Arc validity check

    /// This function gives back \c true if the given arc is valid,

    /// i.e. it is a real arc of the graph.

    ///

    /// \warning A removed arc could become valid again if new edges are

    /// added to the graph.

    bool valid(Arc a) const { return Parent::valid(a); }

    /// \brief Change the first node of an edge.

    ///

    /// This function changes the first node of the given edge \c e to \c n.

    ///

    ///\note \c EdgeIt and \c ArcIt iterators referencing the

    ///changed edge are invalidated and all other iterators whose

    ///base node is the changed node are also invalidated.

    ///

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

    ///Snapshot feature.

    void changeU(Edge e, Node n) {

      Parent::changeU(e,n);

    }

    /// \brief Change the second node of an edge.

    ///

    /// This function changes the second node of the given edge \c e to \c n.

    ///

    ///\note \c EdgeIt iterators referencing the changed edge remain

    ///valid, however \c ArcIt iterators referencing the changed edge and

    ///all other iterators whose base node is the changed node are also

    ///invalidated.

    ///

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

    ///Snapshot feature.

    void changeV(Edge e, Node n) {

      Parent::changeV(e,n);

    }

    /// \brief Contract two nodes.

    ///

    /// This function contracts the given two nodes.

    /// Node \c b is removed, but instead of deleting

    /// its incident edges, they are joined to node \c a.

    /// If the last parameter \c r is \c true (this is the default value),

    /// then the newly created loops are removed.

    ///

    /// \note The moved edges are joined to node \c a using changeU()

    /// or changeV(), thus all edge and arc iterators whose base node is

    /// \c b are invalidated.

    /// Moreover all iterators referencing node \c b or the removed 

    /// loops are also invalidated. Other iterators remain valid.

    ///

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

    ///Snapshot feature.

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

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

        IncEdgeIt f = e; ++f;

        if (r && runningNode(e) == a) {

          erase(e);

        } else if (u(e) == b) {

          changeU(e, a);

        } else {

          changeV(e, a);

        }

        e = f;

      }

      erase(b);

    }

    ///Clear the graph.

    ///This function erases all nodes and arcs from the graph.

    ///

    void clear() {

      Parent::clear();

    }

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

    /// it later.

    ///

    /// Class to make a snapshot of the graph and restore it later.

    ///

    /// The newly added nodes and edges can be removed

    /// using the restore() function.

    ///

    /// \note After a state is restored, you cannot restore a later state, 

    /// i.e. you cannot add the removed nodes and edges again using

    /// another Snapshot instance.

    ///

    /// \warning Node and edge deletions and other modifications

    /// (e.g. changing the end-nodes of edges or contracting nodes)

    /// cannot be restored. These events invalidate the snapshot.

    /// However the edges and nodes that were added to the graph after

    /// making the current snapshot can be removed without invalidating it.

    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)) {

            snapshot.eraseNode(node);

          }

        }

        Snapshot& snapshot;

      };

      class EdgeObserverProxy : public EdgeNotifier::ObserverBase {

      public:

        EdgeObserverProxy(Snapshot& _snapshot)

          : snapshot(_snapshot) {}

        using EdgeNotifier::ObserverBase::attach;

        using EdgeNotifier::ObserverBase::detach;

        using EdgeNotifier::ObserverBase::attached;

      protected:

        virtual void add(const Edge& edge) {

          snapshot.addEdge(edge);

        }

        virtual void add(const std::vector<Edge>& edges) {

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

            snapshot.addEdge(edges[i]);

          }

        }

        virtual void erase(const Edge& edge) {

          snapshot.eraseEdge(edge);

        }

        virtual void erase(const std::vector<Edge>& edges) {

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

            snapshot.eraseEdge(edges[i]);

          }

        }

        virtual void build() {

          Edge edge;

          std::vector<Edge> edges;

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

               notifier()->next(edge)) {

            edges.push_back(edge);

          }

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

            snapshot.addEdge(edges[i]);

          }

        }

        virtual void clear() {

          Edge edge;

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

               notifier()->next(edge)) {

            snapshot.eraseEdge(edge);

          }

        }

        Snapshot& snapshot;

      };

      ListGraph *graph;

      NodeObserverProxy node_observer_proxy;

      EdgeObserverProxy edge_observer_proxy;

      std::list<Node> added_nodes;

      std::list<Edge> added_edges;

      void addNode(const Node& node) {

        added_nodes.push_front(node);

      }

      void eraseNode(const Node& node) {

        std::list<Node>::iterator it =

          std::find(added_nodes.begin(), added_nodes.end(), node);

        if (it == added_nodes.end()) {

          clear();

          edge_observer_proxy.detach();

          throw NodeNotifier::ImmediateDetach();

        } else {

          added_nodes.erase(it);

        }

      }

      void addEdge(const Edge& edge) {

        added_edges.push_front(edge);

      }

      void eraseEdge(const Edge& edge) {

        std::list<Edge>::iterator it =

          std::find(added_edges.begin(), added_edges.end(), edge);

        if (it == added_edges.end()) {

          clear();

          node_observer_proxy.detach();

          throw EdgeNotifier::ImmediateDetach();

        } else {

          added_edges.erase(it);

        }

      }

      void attach(ListGraph &_graph) {

        graph = &_graph;

        node_observer_proxy.attach(graph->notifier(Node()));

        edge_observer_proxy.attach(graph->notifier(Edge()));

      }

      void detach() {

        node_observer_proxy.detach();

        edge_observer_proxy.detach();

      }

      bool attached() const {

        return node_observer_proxy.attached();

      }

      void clear() {

        added_nodes.clear();

        added_edges.clear();

      }

    public:

      /// \brief Default constructor.

      ///

      /// Default constructor.

      /// You have to call save() to actually make a snapshot.

      Snapshot()

        : graph(0), node_observer_proxy(*this),

          edge_observer_proxy(*this) {}

      /// \brief Constructor that immediately makes a snapshot.

    }

    void first(Arc& arc) const {

      arc._id = arcs.size() - 1;

    }

    void next(Arc& arc) const {

      --arc._id;

    }

    void first(Edge& arc) const {

      arc._id = arcs.size() / 2 - 1;

    }

    void next(Edge& arc) const {

      --arc._id;

    }

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

      arc._id = nodes[v._id].first_out;

    }

    void nextOut(Arc &arc) const {

      arc._id = arcs[arc._id].next_out;

    }

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

      arc._id = ((nodes[v._id].first_out) ^ 1);

      if (arc._id == -2) arc._id = -1;

    }

    void nextIn(Arc &arc) const {

      arc._id = ((arcs[arc._id ^ 1].next_out) ^ 1);

      if (arc._id == -2) arc._id = -1;

    }

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

      int de = nodes[v._id].first_out;

      if (de != -1) {

        arc._id = de / 2;

        d = ((de & 1) == 1);

      } else {

        arc._id = -1;

        d = true;

      }

    }

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

      int de = (arcs[(arc._id * 2) | (d ? 1 : 0)].next_out);

      if (de != -1) {

        arc._id = de / 2;

        d = ((de & 1) == 1);

      } else {

        arc._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);}

    bool valid(Node n) const {

      return n._id >= 0 && n._id < static_cast<int>(nodes.size());

    }

    bool valid(Arc a) const {

      return a._id >= 0 && a._id < static_cast<int>(arcs.size());

    }

    bool valid(Edge e) const {

      return e._id >= 0 && 2 * e._id < static_cast<int>(arcs.size());

    }

    Node addNode() {

      int n = nodes.size();

      nodes.push_back(NodeT());

      nodes[n].first_out = -1;

      return Node(n);

    }

    Edge addEdge(Node u, Node v) {

      int n = arcs.size();

      arcs.push_back(ArcT());

      arcs.push_back(ArcT());

      arcs[n].target = u._id;

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

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

      nodes[v._id].first_out = n;

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

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

      return Edge(n / 2);

    }

    void clear() {

      arcs.clear();

      nodes.clear();

    }

  };

  typedef GraphExtender<SmartGraphBase> ExtendedSmartGraphBase;

  /// \ingroup graphs

  ///

  /// \brief A smart undirected graph class.

  ///

  /// \ref SmartGraph is a simple and fast graph implementation.

  /// It is also quite memory efficient but at the price

  /// that it does not support node and edge deletion 

  /// (except for the Snapshot feature).

  ///

  /// This type fully conforms to the \ref concepts::Graph "Graph concept"

  /// and it also provides some additional functionalities.

  /// Most of its member functions and nested classes are documented

  /// only in the concept class.

  ///

  /// \sa concepts::Graph

  /// \sa SmartDigraph

  class SmartGraph : public ExtendedSmartGraphBase {

    typedef ExtendedSmartGraphBase Parent;

  private:

    /// Graphs are \e not copy constructible. Use GraphCopy instead.

    SmartGraph(const SmartGraph &) : ExtendedSmartGraphBase() {};

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

    /// Use GraphCopy instead.

    void operator=(const SmartGraph &) {}

  public:

    /// Constructor

    /// Constructor.

    ///

    SmartGraph() {}

    /// \brief Add a new node to the graph.

    ///

    /// This function adds a new node to the graph.

    /// \return The new node.

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

    /// \brief Add a new edge to the graph.

    ///

    /// This function adds a new edge to the graph between nodes

    /// \c u and \c v with inherent orientation from node \c u to

    /// node \c v.

    /// \return The new edge.

    Edge addEdge(Node u, Node v) {

      return Parent::addEdge(u, v);

    }

    /// \brief Node validity check

    ///

    /// This function gives back \c true if the given node is valid,

    /// i.e. it is a real node of the graph.

    ///

    /// \warning A removed node (using Snapshot) could become valid again

    /// if new nodes are added to the graph.

    bool valid(Node n) const { return Parent::valid(n); }

    /// \brief Edge validity check

    ///

    /// This function gives back \c true if the given edge is valid,

    /// i.e. it is a real edge of the graph.

    ///

    /// \warning A removed edge (using Snapshot) could become valid again

    /// if new edges are added to the graph.

    bool valid(Edge e) const { return Parent::valid(e); }

    /// \brief Arc validity check

    ///

    /// This function gives back \c true if the given arc is valid,

    /// i.e. it is a real arc of the graph.

    ///

    /// \warning A removed arc (using Snapshot) could become valid again

    /// if new edges are added to the graph.

    bool valid(Arc a) const { return Parent::valid(a); }

    ///Clear the graph.

    ///This function erases all nodes and arcs from the graph.

    ///

    void clear() {

      Parent::clear();

    }

  public:

    class Snapshot;

  protected:

    void saveSnapshot(Snapshot &s)

    {

      s._graph = this;

      s.node_num = nodes.size();

      s.arc_num = arcs.size();

    }

    void restoreSnapshot(const Snapshot &s)

    {

      while(s.arc_num<arcs.size()) {

        int n=arcs.size()-1;

        Edge arc=edgeFromId(n/2);

        Parent::notifier(Edge()).erase(arc);

        std::vector<Arc> dir;

        dir.push_back(arcFromId(n));

        dir.push_back(arcFromId(n-1));

        Parent::notifier(Arc()).erase(dir);

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

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

        arcs.pop_back();

        arcs.pop_back();

      }

      while(s.node_num<nodes.size()) {

        int n=nodes.size()-1;

        Node node = nodeFromId(n);

        Parent::notifier(Node()).erase(node);

        nodes.pop_back();

      }

    }

  public:

    ///Class to make a snapshot of the graph and to restore it later.

    ///Class to make a snapshot of the graph and to restore it later.

    ///

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

    ///restore() function. This is the only way for deleting nodes and/or

    ///edges from a SmartGraph structure.

    ///

    ///\note After a state is restored, you cannot restore a later state, 

    ///i.e. you cannot add the removed nodes and edges again using

    ///another Snapshot instance.

    ///

    ///\warning The validity of the snapshot is not stored due to

    ///performance reasons. If you do not use the snapshot correctly,

    ///it can cause broken program, invalid or not restored state of

    ///the graph or no change.

    class Snapshot

    {

      SmartGraph *_graph;

    protected:

      friend class SmartGraph;

      unsigned int node_num;

      unsigned int arc_num;

    public:

      ///Default constructor.

      ///Default constructor.

      ///You have to call save() to actually make a snapshot.

      Snapshot() : _graph(0) {}

      ///Constructor that immediately makes a snapshot

      /// This constructor immediately makes a snapshot of the given graph.

      ///

      Snapshot(SmartGraph &gr) {

        gr.saveSnapshot(*this);

      }

      ///Make a snapshot.

      ///This function makes a snapshot of the given graph.

      ///It can be called more than once. In case of a repeated

      ///call, the previous snapshot gets lost.

      void save(SmartGraph &gr)

      {

        gr.saveSnapshot(*this);

      }

      ///Undo the changes until the last snapshot.

      ///This function undos the changes until the last snapshot

      ///created by save() or Snapshot(SmartGraph&).

      void restore()

      {

        _graph->restoreSnapshot(*this);

      }

    };

  };

} //namespace lemon

#endif //LEMON_SMART_GRAPH_H

/* -*- mode: C++; indent-tabs-mode: nil; -*-

 *

 * This file is a part of LEMON, a generic C++ optimization library.

 *

 * Copyright (C) 2003-2009

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Research Group on Combinatorial Optimization, EGRES).

 *

 * Permission to use, modify and distribute this software is granted

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

 *

 */

#include <lemon/concepts/digraph.h>

#include <lemon/list_graph.h>

#include <lemon/smart_graph.h>

#include <lemon/full_graph.h>

#include "test_tools.h"

#include "graph_test.h"

using namespace lemon;

using namespace lemon::concepts;

template <class Digraph>

void checkDigraphBuild() {

  TEMPLATE_DIGRAPH_TYPEDEFS(Digraph);

  Digraph G;

  checkGraphNodeList(G, 0);

  checkGraphArcList(G, 0);

  Node

    n1 = G.addNode(),

    n2 = G.addNode(),

    n3 = G.addNode();

  checkGraphNodeList(G, 3);

  checkGraphArcList(G, 0);

  Arc a1 = G.addArc(n1, n2);

  check(G.source(a1) == n1 && G.target(a1) == n2, "Wrong arc");

  checkGraphNodeList(G, 3);

  checkGraphArcList(G, 1);

  checkGraphOutArcList(G, n1, 1);

  checkGraphOutArcList(G, n2, 0);

  checkGraphOutArcList(G, n3, 0);

  checkGraphInArcList(G, n1, 0);

  checkGraphInArcList(G, n2, 1);

  checkGraphInArcList(G, n3, 0);

  checkGraphConArcList(G, 1);

  Arc a2 = G.addArc(n2, n1),

      a3 = G.addArc(n2, n3),

      a4 = G.addArc(n2, n3);

  checkGraphNodeList(G, 3);

  checkGraphArcList(G, 4);

  checkGraphOutArcList(G, n1, 1);

  checkGraphOutArcList(G, n2, 3);

  checkGraphOutArcList(G, n3, 0);

  checkGraphInArcList(G, n1, 1);

  checkGraphInArcList(G, n2, 1);

  checkGraphInArcList(G, n3, 2);

  checkGraphConArcList(G, 4);

  checkNodeIds(G);

  checkArcIds(G);

  checkGraphNodeMap(G);

  checkGraphArcMap(G);

}

template <class Digraph>

void checkDigraphSplit() {

  TEMPLATE_DIGRAPH_TYPEDEFS(Digraph);

  Digraph G;

  Node n1 = G.addNode(), n2 = G.addNode(), n3 = G.addNode();

  Arc a1 = G.addArc(n1, n2), a2 = G.addArc(n2, n1),

      a3 = G.addArc(n2, n3), a4 = G.addArc(n2, n3);

  Node n4 = G.split(n2);

  check(G.target(OutArcIt(G, n2)) == n4 &&

        G.source(InArcIt(G, n4)) == n2,

        "Wrong split.");

  checkGraphNodeList(G, 4);

  checkGraphArcList(G, 5);

  checkGraphOutArcList(G, n1, 1);

  checkGraphOutArcList(G, n2, 1);

  checkGraphOutArcList(G, n3, 0);

  checkGraphOutArcList(G, n4, 3);

  checkGraphInArcList(G, n1, 1);

  checkGraphInArcList(G, n2, 1);

  checkGraphInArcList(G, n3, 2);

  checkGraphInArcList(G, n4, 1);

  checkGraphConArcList(G, 5);

}

template <class Digraph>

void checkDigraphAlter() {

  TEMPLATE_DIGRAPH_TYPEDEFS(Digraph);

  Digraph G;

  Node n1 = G.addNode(), n2 = G.addNode(),

       n3 = G.addNode(), n4 = G.addNode();

  Arc a1 = G.addArc(n1, n2), a2 = G.addArc(n4, n1),

      a3 = G.addArc(n4, n3), a4 = G.addArc(n4, n3),

      a5 = G.addArc(n2, n4);

  checkGraphNodeList(G, 4);

  checkGraphArcList(G, 5);

  // Check changeSource() and changeTarget()

  G.changeTarget(a4, n1);

  checkGraphNodeList(G, 4);

  checkGraphArcList(G, 5);

  checkGraphOutArcList(G, n1, 1);

  checkGraphOutArcList(G, n2, 1);

  checkGraphOutArcList(G, n3, 0);

  checkGraphOutArcList(G, n4, 3);

  checkGraphInArcList(G, n1, 2);

  checkGraphInArcList(G, n2, 1);

  checkGraphInArcList(G, n3, 1);

  checkGraphInArcList(G, n4, 1);

  checkGraphConArcList(G, 5);

  G.changeSource(a4, n3);

  checkGraphNodeList(G, 4);

  checkGraphArcList(G, 5);

  checkGraphOutArcList(G, n1, 1);

  checkGraphOutArcList(G, n2, 1);

  checkGraphOutArcList(G, n3, 1);

  checkGraphOutArcList(G, n4, 2);

  checkGraphInArcList(G, n1, 2);

  checkGraphInArcList(G, n2, 1);

  checkGraphInArcList(G, n3, 1);

  checkGraphInArcList(G, n4, 1);

  checkGraphConArcList(G, 5);

  // Check contract()

  G.contract(n2, n4, false);

  checkGraphNodeList(G, 3);

  checkGraphArcList(G, 5);

  checkGraphOutArcList(G, n1, 1);

  checkGraphOutArcList(G, n2, 3);

  checkGraphOutArcList(G, n3, 1);

  checkGraphInArcList(G, n1, 2);

  checkGraphInArcList(G, n2, 2);

  checkGraphInArcList(G, n3, 1);

  checkGraphConArcList(G, 5);

  G.contract(n2, n1);

  checkGraphNodeList(G, 2);

  checkGraphArcList(G, 3);

  checkGraphOutArcList(G, n2, 2);

  checkGraphOutArcList(G, n3, 1);

  checkGraphInArcList(G, n2, 2);

  checkGraphInArcList(G, n3, 1);

  checkGraphConArcList(G, 3);

}

template <class Digraph>

void checkDigraphErase() {

  TEMPLATE_DIGRAPH_TYPEDEFS(Digraph);

  Digraph G;

  Node n1 = G.addNode(), n2 = G.addNode(),

       n3 = G.addNode(), n4 = G.addNode();

  Arc a1 = G.addArc(n1, n2), a2 = G.addArc(n4, n1),

      a3 = G.addArc(n4, n3), a4 = G.addArc(n3, n1),

      a5 = G.addArc(n2, n4);

  // Check arc deletion

  G.erase(a1);

  checkGraphNodeList(G, 4);

  checkGraphArcList(G, 4);

  checkGraphOutArcList(G, n1, 0);

  checkGraphOutArcList(G, n2, 1);

  checkGraphOutArcList(G, n3, 1);

  checkGraphOutArcList(G, n4, 2);

  checkGraphInArcList(G, n1, 2);

  checkGraphInArcList(G, n2, 0);

  checkGraphInArcList(G, n3, 1);

  checkGraphInArcList(G, n4, 1);

  checkGraphConArcList(G, 4);

  // Check node deletion

  G.erase(n4);

  checkGraphNodeList(G, 3);

  checkGraphArcList(G, 1);

  checkGraphOutArcList(G, n1, 0);

  checkGraphOutArcList(G, n2, 0);

/* -*- mode: C++; indent-tabs-mode: nil; -*-

 *

 * This file is a part of LEMON, a generic C++ optimization library.

 *

 * Copyright (C) 2003-2009

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Research Group on Combinatorial Optimization, EGRES).

 *

 * Permission to use, modify and distribute this software is granted

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

 *

 */

#include <lemon/concepts/graph.h>

#include <lemon/list_graph.h>

#include <lemon/smart_graph.h>

#include <lemon/full_graph.h>

#include <lemon/grid_graph.h>

#include <lemon/hypercube_graph.h>

#include "test_tools.h"

#include "graph_test.h"

using namespace lemon;

using namespace lemon::concepts;

template <class Graph>

void checkGraphBuild() {

  TEMPLATE_GRAPH_TYPEDEFS(Graph);

  Graph G;

  checkGraphNodeList(G, 0);

  checkGraphEdgeList(G, 0);

  checkGraphArcList(G, 0);

  Node

    n1 = G.addNode(),

    n2 = G.addNode(),

    n3 = G.addNode();

  checkGraphNodeList(G, 3);

  checkGraphEdgeList(G, 0);

  checkGraphArcList(G, 0);

  Edge e1 = G.addEdge(n1, n2);

  check((G.u(e1) == n1 && G.v(e1) == n2) || (G.u(e1) == n2 && G.v(e1) == n1),

        "Wrong edge");

  checkGraphNodeList(G, 3);

  checkGraphEdgeList(G, 1);

  checkGraphArcList(G, 2);

  checkGraphIncEdgeArcLists(G, n1, 1);

  checkGraphIncEdgeArcLists(G, n2, 1);

  checkGraphIncEdgeArcLists(G, n3, 0);

  checkGraphConEdgeList(G, 1);

  checkGraphConArcList(G, 2);

  Edge e2 = G.addEdge(n2, n1),

       e3 = G.addEdge(n2, n3);

  checkGraphNodeList(G, 3);

  checkGraphEdgeList(G, 3);

  checkGraphArcList(G, 6);

  checkGraphIncEdgeArcLists(G, n1, 2);

  checkGraphIncEdgeArcLists(G, n2, 3);

  checkGraphIncEdgeArcLists(G, n3, 1);

  checkGraphConEdgeList(G, 3);

  checkGraphConArcList(G, 6);

  checkArcDirections(G);

  checkNodeIds(G);

  checkArcIds(G);

  checkEdgeIds(G);

  checkGraphNodeMap(G);

  checkGraphArcMap(G);

  checkGraphEdgeMap(G);

}

template <class Graph>

void checkGraphAlter() {

  TEMPLATE_GRAPH_TYPEDEFS(Graph);

  Graph G;

  Node n1 = G.addNode(), n2 = G.addNode(),

       n3 = G.addNode(), n4 = G.addNode();

  Edge e1 = G.addEdge(n1, n2), e2 = G.addEdge(n2, n1),

       e3 = G.addEdge(n2, n3), e4 = G.addEdge(n1, n4),

       e5 = G.addEdge(n4, n3);

  checkGraphNodeList(G, 4);

  checkGraphEdgeList(G, 5);

  checkGraphArcList(G, 10);

  // Check changeU() and changeV()

  if (G.u(e2) == n2) {

    G.changeU(e2, n3);

  } else {

    G.changeV(e2, n3);

  }

  checkGraphNodeList(G, 4);

  checkGraphEdgeList(G, 5);

  checkGraphArcList(G, 10);

  checkGraphIncEdgeArcLists(G, n1, 3);

  checkGraphIncEdgeArcLists(G, n2, 2);

  checkGraphIncEdgeArcLists(G, n3, 3);

  checkGraphIncEdgeArcLists(G, n4, 2);

  checkGraphConEdgeList(G, 5);

  checkGraphConArcList(G, 10);

  if (G.u(e2) == n1) {

    G.changeU(e2, n2);

  } else {

    G.changeV(e2, n2);

  }

  checkGraphNodeList(G, 4);

  checkGraphEdgeList(G, 5);

  checkGraphArcList(G, 10);

  checkGraphIncEdgeArcLists(G, n1, 2);

  checkGraphIncEdgeArcLists(G, n2, 3);

  checkGraphIncEdgeArcLists(G, n3, 3);

  checkGraphIncEdgeArcLists(G, n4, 2);

  checkGraphConEdgeList(G, 5);

  checkGraphConArcList(G, 10);

  // Check contract()

  G.contract(n1, n4, false);

  checkGraphNodeList(G, 3);

  checkGraphEdgeList(G, 5);

  checkGraphArcList(G, 10);

  checkGraphIncEdgeArcLists(G, n1, 4);

  checkGraphIncEdgeArcLists(G, n2, 3);

  checkGraphIncEdgeArcLists(G, n3, 3);

  checkGraphConEdgeList(G, 5);

  checkGraphConArcList(G, 10);