RhodeCode

    ///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]);

    /// \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

/* -*- 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);

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