RhodeCode

        }

        attach(gr);

      }

      /// \brief Undo the changes until the last snapshot.

      ///

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

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

      void restore() {

        detach();

        for(std::list<Arc>::iterator it = added_arcs.begin();

            it != added_arcs.end(); ++it) {

          digraph->erase(*it);

        }

        for(std::list<Node>::iterator it = added_nodes.begin();

            it != added_nodes.end(); ++it) {

        }

        attach(gr);

      }

      /// \brief Undo the changes until the last snapshot.

      ///

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

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

      void restore() {

        detach();

        for(std::list<Edge>::iterator it = added_edges.begin();

            it != added_edges.end(); ++it) {

          graph->erase(*it);

        }

        for(std::list<Node>::iterator it = added_nodes.begin();

            it != added_nodes.end(); ++it) {

  checkGraphArcMap(G);

  G.addNode();

  snapshot.save(G);

  G.addArc(G.addNode(), G.addNode());

  snapshot.restore();

  checkGraphNodeList(G, 4);

  checkGraphArcList(G, 4);

}

void checkConcepts() {

  { // Checking digraph components

    checkConcept<BaseDigraphComponent, BaseDigraphComponent >();

  checkGraphArcMap(G);

  G.addNode();

  snapshot.save(G);

  G.addEdge(G.addNode(), G.addNode());

  snapshot.restore();

  checkGraphNodeList(G, 4);

  checkGraphEdgeList(G, 3);

  checkGraphArcList(G, 6);

}

void checkFullGraph(int num) {

  typedef FullGraph Graph;