RhodeCode

    ///

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

    /// ie. it is a real arc of the graph.

    ///

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

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

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

    /// \brief Edge validity check

    ///

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

    /// ie. it is a real edge of the graph.

    ///

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

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

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

    ///Clear the graph.

    ///Erase all the nodes and edges 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);

        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 digraph and to restrore to it later.

    ///Class to make a snapshot of the digraph and to restrore to it later.

    ///

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

    ///restore() function.

    ///

    ///\note After you restore a state, you cannot restore

    ///a later state, in other word you cannot add again the arcs deleted

    ///by restore() using another one Snapshot instance.

    ///

    ///\warning If you do not use correctly the snapshot that can cause

    ///either broken program, invalid state of the digraph, valid but

    ///not the restored digraph or no change. Because the runtime performance

    ///the validity of the snapshot is not stored.

    class Snapshot

    {

      SmartGraph *_graph;

    protected:

      friend class SmartGraph;

      unsigned int node_num;

      unsigned int arc_num;

    public:

      ///Default constructor.

      ///Default constructor.

      ///To actually make a snapshot you must call save().

      ///

      Snapshot() : _graph(0) {}

      ///Constructor that immediately makes a snapshot

      ///This constructor immediately makes a snapshot of the digraph.

      ///\param graph The digraph we make a snapshot of.

      Snapshot(SmartGraph &graph) {

        graph.saveSnapshot(*this);

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

 *

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

 *

 * Copyright (C) 2003-2008

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

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

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

}

void checkConcepts() {

  { // Checking digraph components

    checkConcept<BaseDigraphComponent, BaseDigraphComponent >();

    checkConcept<IDableDigraphComponent<>,

      IDableDigraphComponent<> >();

    checkConcept<IterableDigraphComponent<>,

      IterableDigraphComponent<> >();

    checkConcept<MappableDigraphComponent<>,

      MappableDigraphComponent<> >();

  }

  { // Checking skeleton digraph

    checkConcept<Digraph, Digraph>();

  }

  { // Checking ListDigraph

    checkConcept<Digraph, ListDigraph>();

    checkConcept<AlterableDigraphComponent<>, ListDigraph>();

    checkConcept<ExtendableDigraphComponent<>, ListDigraph>();

    checkConcept<ClearableDigraphComponent<>, ListDigraph>();

    checkConcept<ErasableDigraphComponent<>, ListDigraph>();

  }

  { // Checking SmartDigraph

    checkConcept<Digraph, SmartDigraph>();

    checkConcept<AlterableDigraphComponent<>, SmartDigraph>();

    checkConcept<ExtendableDigraphComponent<>, SmartDigraph>();

    checkConcept<ClearableDigraphComponent<>, SmartDigraph>();

  }

  { // Checking FullDigraph

    checkConcept<Digraph, FullDigraph>();

  }

}

template <typename Digraph>

void checkDigraphValidity() {

  TEMPLATE_DIGRAPH_TYPEDEFS(Digraph);

  Digraph g;

  Node

    n1 = g.addNode(),

    n2 = g.addNode(),

    n3 = g.addNode();

  Arc

    e1 = g.addArc(n1, n2),

    e2 = g.addArc(n2, n3);

  check(g.valid(n1), "Wrong validity check");

  check(g.valid(e1), "Wrong validity check");

  check(!g.valid(g.nodeFromId(-1)), "Wrong validity check");

  check(!g.valid(g.arcFromId(-1)), "Wrong validity check");

}

template <typename Digraph>

void checkDigraphValidityErase() {

  TEMPLATE_DIGRAPH_TYPEDEFS(Digraph);

  Digraph g;

  Node

    n1 = g.addNode(),

    n2 = g.addNode(),

    n3 = g.addNode();

  Arc

    e1 = g.addArc(n1, n2),

    e2 = g.addArc(n2, n3);

  check(g.valid(n1), "Wrong validity check");

  check(g.valid(e1), "Wrong validity check");

  g.erase(n1);

  check(!g.valid(n1), "Wrong validity check");

  check(g.valid(n2), "Wrong validity check");

  check(g.valid(n3), "Wrong validity check");

  check(!g.valid(e1), "Wrong validity check");

  check(g.valid(e2), "Wrong validity check");

  check(!g.valid(g.nodeFromId(-1)), "Wrong validity check");

  check(!g.valid(g.arcFromId(-1)), "Wrong validity check");

}

void checkDigraphs() {

  { // Checking ListDigraph

    checkDigraphValidityErase<ListDigraph>();

  }

  { // Checking SmartDigraph

    checkDigraphValidity<SmartDigraph>();

  }

  { // Checking FullDigraph

    checkFullDigraph(8);

  }

}

int main() {

  checkDigraphs();

  checkConcepts();

  return 0;

}

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

 *

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

 *

 * Copyright (C) 2003-2008

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

  TEMPLATE_GRAPH_TYPEDEFS(Graph);

  Graph G;

  checkGraphNodeList(G, 0);

  checkGraphEdgeList(G, 0);

  Node

    n1 = G.addNode(),

    n2 = G.addNode(),

    n3 = G.addNode();

  checkGraphNodeList(G, 3);

  checkGraphEdgeList(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);

  checkGraphArcList(G, 2);

  checkGraphConArcList(G, 6);

  checkArcDirections(G);

  checkNodeIds(G);

  checkArcIds(G);

  checkEdgeIds(G);

  checkGraphNodeMap(G);

  checkGraphArcMap(G);

  checkGraphEdgeMap(G);

}

void checkFullGraph(int num) {

  typedef FullGraph Graph;

  GRAPH_TYPEDEFS(Graph);

  Graph G(num);

  checkGraphNodeList(G, num);

  checkGraphEdgeList(G, num * (num - 1) / 2);

  for (NodeIt n(G); n != INVALID; ++n) {

    checkGraphOutArcList(G, n, num - 1);

    checkGraphInArcList(G, n, num - 1);

    checkGraphIncEdgeList(G, n, num - 1);

  }

  checkGraphConArcList(G, num * (num - 1));

  checkGraphConEdgeList(G, num * (num - 1) / 2);

  checkArcDirections(G);

  checkNodeIds(G);

  checkArcIds(G);

  checkEdgeIds(G);

  checkGraphNodeMap(G);

  checkGraphArcMap(G);

  checkGraphEdgeMap(G);

  for (int i = 0; i < G.nodeNum(); ++i) {

    check(G.index(G(i)) == i, "Wrong index");

  }

  for (NodeIt u(G); u != INVALID; ++u) {

    for (NodeIt v(G); v != INVALID; ++v) {

      Edge e = G.edge(u, v);

      Arc a = G.arc(u, v);

      if (u == v) {

        check(e == INVALID, "Wrong edge lookup");

        check(a == INVALID, "Wrong arc lookup");

      } else {

        check((G.u(e) == u && G.v(e) == v) ||

              (G.u(e) == v && G.v(e) == u), "Wrong edge lookup");

        check(G.source(a) == u && G.target(a) == v, "Wrong arc lookup");

      }

    }

  }

}

void checkConcepts() {

  HypercubeGraph G(dim);

  checkGraphNodeList(G, 1 << dim);

  checkGraphEdgeList(G, dim * (1 << (dim-1)));

  checkGraphArcList(G, dim * (1 << dim));

  Node n = G.nodeFromId(dim);

  for (NodeIt n(G); n != INVALID; ++n) {

    checkGraphIncEdgeList(G, n, dim);

    for (IncEdgeIt e(G, n); e != INVALID; ++e) {

      check( (G.u(e) == n &&

              G.id(G.v(e)) == (G.id(n) ^ (1 << G.dimension(e)))) ||

             (G.v(e) == n &&

              G.id(G.u(e)) == (G.id(n) ^ (1 << G.dimension(e)))),

             "Wrong edge or wrong dimension");

    }

    checkGraphOutArcList(G, n, dim);

    for (OutArcIt a(G, n); a != INVALID; ++a) {

      check(G.source(a) == n &&

            G.id(G.target(a)) == (G.id(n) ^ (1 << G.dimension(a))),

            "Wrong arc or wrong dimension");

    }

    checkGraphInArcList(G, n, dim);

    for (InArcIt a(G, n); a != INVALID; ++a) {

      check(G.target(a) == n &&

            G.id(G.source(a)) == (G.id(n) ^ (1 << G.dimension(a))),

            "Wrong arc or wrong dimension");

    }

  }

  checkGraphConArcList(G, (1 << dim) * dim);

  checkGraphConEdgeList(G, dim * (1 << (dim-1)));

  checkArcDirections(G);

  checkNodeIds(G);

  checkArcIds(G);

  checkEdgeIds(G);

  checkGraphNodeMap(G);

  checkGraphArcMap(G);

  checkGraphEdgeMap(G);

}

void checkGraphs() {

  { // Checking ListGraph

    checkGraphValidityErase<ListGraph>();

  }

  { // Checking SmartGraph

    checkGraphValidity<SmartGraph>();

  }

  { // Checking FullGraph

    checkFullGraph(7);

    checkFullGraph(8);

  }

  { // Checking GridGraph

    checkGridGraph(5, 8);

    checkGridGraph(8, 5);

    checkGridGraph(5, 5);

    checkGridGraph(0, 0);

    checkGridGraph(1, 1);

  }

  { // Checking HypercubeGraph

    checkHypercubeGraph(1);

    checkHypercubeGraph(2);

    checkHypercubeGraph(3);

    checkHypercubeGraph(4);

  }

}

int main() {

  checkConcepts();

  checkGraphs();

  return 0;

}

  }

  template<class Graph>

  void checkGraphInArcList(const Graph &G, typename Graph::Node n, int cnt)

  {

    typename Graph::InArcIt e(G,n);

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

      check(e!=INVALID,"Wrong InArc list linking.");

      check(n==G.target(e),"Wrong InArc list linking.");

      check(n==G.baseNode(e),"Wrong OutArc list linking.");

      check(G.source(e)==G.runningNode(e),"Wrong OutArc list linking.");

      ++e;

    }

    check(e==INVALID,"Wrong InArc list linking.");

    check(countInArcs(G,n)==cnt,"Wrong InArc number.");

  }

  template<class Graph>

  void checkGraphEdgeList(const Graph &G, int cnt)

  {

    typename Graph::EdgeIt e(G);

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

      check(e!=INVALID,"Wrong Edge list linking.");

      check(G.oppositeNode(G.u(e), e) == G.v(e), "Wrong opposite node");

      check(G.oppositeNode(G.v(e), e) == G.u(e), "Wrong opposite node");

      ++e;

    }

    check(e==INVALID,"Wrong Edge list linking.");

    check(countEdges(G)==cnt,"Wrong Edge number.");

  }

  template<class Graph>

  void checkGraphIncEdgeList(const Graph &G, typename Graph::Node n, int cnt)

  {

    typename Graph::IncEdgeIt e(G,n);

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

      check(e!=INVALID,"Wrong IncEdge list linking.");

      check(n==G.u(e) || n==G.v(e),"Wrong IncEdge list linking.");

      check(n==G.baseNode(e),"Wrong OutArc list linking.");

      check(G.u(e)==G.runningNode(e) || G.v(e)==G.runningNode(e),

            "Wrong OutArc list linking.");

      ++e;

    }

    check(e==INVALID,"Wrong IncEdge list linking.");

    check(countIncEdges(G,n)==cnt,"Wrong IncEdge number.");

  }

  template <class Graph>

  void checkGraphConArcList(const Graph &G, int cnt) {

    int i = 0;

    for (typename Graph::NodeIt u(G); u != INVALID; ++u) {

      for (typename Graph::NodeIt v(G); v != INVALID; ++v) {

        for (ConArcIt<Graph> a(G, u, v); a != INVALID; ++a) {

          check(G.source(a) == u, "Wrong iterator.");

          check(G.target(a) == v, "Wrong iterator.");

          ++i;

        }

      }

    }

    check(cnt == i, "Wrong iterator.");

  }

  template <class Graph>

  void checkGraphConEdgeList(const Graph &G, int cnt) {

    int i = 0;

    for (typename Graph::NodeIt u(G); u != INVALID; ++u) {

      for (typename Graph::NodeIt v(G); v != INVALID; ++v) {

        for (ConEdgeIt<Graph> e(G, u, v); e != INVALID; ++e) {

          check((G.u(e) == u && G.v(e) == v) ||

                (G.u(e) == v && G.v(e) == u), "Wrong iterator.");

          i += u == v ? 2 : 1;

        }

      }

    }

    check(2 * cnt == i, "Wrong iterator.");

  }

  template <typename Graph>

  void checkArcDirections(const Graph& G) {

    for (typename Graph::ArcIt a(G); a != INVALID; ++a) {

      check(G.source(a) == G.target(G.oppositeArc(a)), "Wrong direction");

      check(G.target(a) == G.source(G.oppositeArc(a)), "Wrong direction");

      check(G.direct(a, G.direction(a)) == a, "Wrong direction");

    }

  }

  template <typename Graph>

  void checkNodeIds(const Graph& G) {

    std::set<int> values;

    for (typename Graph::NodeIt n(G); n != INVALID; ++n) {

      check(G.nodeFromId(G.id(n)) == n, "Wrong id");

      check(values.find(G.id(n)) == values.end(), "Wrong id");

      check(G.id(n) <= G.maxNodeId(), "Wrong maximum id");

      values.insert(G.id(n));

    }

  }