alpar@209: /* -*- mode: C++; indent-tabs-mode: nil; -*-
deba@57:  *
alpar@209:  * This file is a part of LEMON, a generic C++ optimization library.
deba@57:  *
alpar@440:  * Copyright (C) 2003-2009
deba@57:  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
deba@57:  * (Egervary Research Group on Combinatorial Optimization, EGRES).
deba@57:  *
deba@57:  * Permission to use, modify and distribute this software is granted
deba@57:  * provided that this copyright notice appears in all copies. For
deba@57:  * precise terms see the accompanying LICENSE file.
deba@57:  *
deba@57:  * This software is provided "AS IS" with no warranty of any kind,
deba@57:  * express or implied, and with no claim as to its suitability for any
deba@57:  * purpose.
deba@57:  *
deba@57:  */
deba@57: 
deba@57: #include <lemon/concepts/graph.h>
deba@57: #include <lemon/list_graph.h>
deba@109: #include <lemon/smart_graph.h>
deba@353: #include <lemon/full_graph.h>
kpeter@334: #include <lemon/grid_graph.h>
kpeter@365: #include <lemon/hypercube_graph.h>
deba@57: 
deba@57: #include "test_tools.h"
kpeter@171: #include "graph_test.h"
deba@57: 
deba@57: using namespace lemon;
deba@57: using namespace lemon::concepts;
deba@57: 
deba@228: template <class Graph>
kpeter@374: void checkGraphBuild() {
deba@228:   TEMPLATE_GRAPH_TYPEDEFS(Graph);
deba@228: 
deba@228:   Graph G;
deba@228:   checkGraphNodeList(G, 0);
deba@228:   checkGraphEdgeList(G, 0);
kpeter@374:   checkGraphArcList(G, 0);
deba@228: 
kpeter@736:   G.reserveNode(3);
kpeter@736:   G.reserveEdge(3);
kpeter@736: 
deba@228:   Node
deba@228:     n1 = G.addNode(),
deba@228:     n2 = G.addNode(),
deba@228:     n3 = G.addNode();
deba@228:   checkGraphNodeList(G, 3);
deba@228:   checkGraphEdgeList(G, 0);
kpeter@374:   checkGraphArcList(G, 0);
deba@228: 
deba@228:   Edge e1 = G.addEdge(n1, n2);
deba@228:   check((G.u(e1) == n1 && G.v(e1) == n2) || (G.u(e1) == n2 && G.v(e1) == n1),
deba@228:         "Wrong edge");
kpeter@374: 
deba@228:   checkGraphNodeList(G, 3);
kpeter@374:   checkGraphEdgeList(G, 1);
deba@228:   checkGraphArcList(G, 2);
deba@228: 
kpeter@374:   checkGraphIncEdgeArcLists(G, n1, 1);
kpeter@374:   checkGraphIncEdgeArcLists(G, n2, 1);
kpeter@374:   checkGraphIncEdgeArcLists(G, n3, 0);
deba@228: 
kpeter@374:   checkGraphConEdgeList(G, 1);
kpeter@374:   checkGraphConArcList(G, 2);
deba@228: 
kpeter@374:   Edge e2 = G.addEdge(n2, n1),
kpeter@374:        e3 = G.addEdge(n2, n3);
deba@228: 
kpeter@374:   checkGraphNodeList(G, 3);
kpeter@374:   checkGraphEdgeList(G, 3);
kpeter@374:   checkGraphArcList(G, 6);
deba@228: 
kpeter@374:   checkGraphIncEdgeArcLists(G, n1, 2);
kpeter@374:   checkGraphIncEdgeArcLists(G, n2, 3);
kpeter@374:   checkGraphIncEdgeArcLists(G, n3, 1);
deba@228: 
kpeter@374:   checkGraphConEdgeList(G, 3);
deba@228:   checkGraphConArcList(G, 6);
deba@228: 
deba@228:   checkArcDirections(G);
deba@228: 
deba@228:   checkNodeIds(G);
deba@228:   checkArcIds(G);
deba@228:   checkEdgeIds(G);
deba@228:   checkGraphNodeMap(G);
deba@228:   checkGraphArcMap(G);
deba@228:   checkGraphEdgeMap(G);
deba@228: }
deba@228: 
kpeter@374: template <class Graph>
kpeter@374: void checkGraphAlter() {
kpeter@374:   TEMPLATE_GRAPH_TYPEDEFS(Graph);
kpeter@374: 
kpeter@374:   Graph G;
kpeter@374:   Node n1 = G.addNode(), n2 = G.addNode(),
kpeter@374:        n3 = G.addNode(), n4 = G.addNode();
kpeter@374:   Edge e1 = G.addEdge(n1, n2), e2 = G.addEdge(n2, n1),
kpeter@374:        e3 = G.addEdge(n2, n3), e4 = G.addEdge(n1, n4),
kpeter@374:        e5 = G.addEdge(n4, n3);
kpeter@374: 
kpeter@374:   checkGraphNodeList(G, 4);
kpeter@374:   checkGraphEdgeList(G, 5);
kpeter@374:   checkGraphArcList(G, 10);
kpeter@374: 
kpeter@374:   // Check changeU() and changeV()
kpeter@374:   if (G.u(e2) == n2) {
kpeter@374:     G.changeU(e2, n3);
kpeter@374:   } else {
kpeter@374:     G.changeV(e2, n3);
kpeter@374:   }
kpeter@374: 
kpeter@374:   checkGraphNodeList(G, 4);
kpeter@374:   checkGraphEdgeList(G, 5);
kpeter@374:   checkGraphArcList(G, 10);
kpeter@374: 
kpeter@374:   checkGraphIncEdgeArcLists(G, n1, 3);
kpeter@374:   checkGraphIncEdgeArcLists(G, n2, 2);
kpeter@374:   checkGraphIncEdgeArcLists(G, n3, 3);
kpeter@374:   checkGraphIncEdgeArcLists(G, n4, 2);
kpeter@374: 
kpeter@374:   checkGraphConEdgeList(G, 5);
kpeter@374:   checkGraphConArcList(G, 10);
kpeter@374: 
kpeter@374:   if (G.u(e2) == n1) {
kpeter@374:     G.changeU(e2, n2);
kpeter@374:   } else {
kpeter@374:     G.changeV(e2, n2);
kpeter@374:   }
kpeter@374: 
kpeter@374:   checkGraphNodeList(G, 4);
kpeter@374:   checkGraphEdgeList(G, 5);
kpeter@374:   checkGraphArcList(G, 10);
kpeter@374: 
kpeter@374:   checkGraphIncEdgeArcLists(G, n1, 2);
kpeter@374:   checkGraphIncEdgeArcLists(G, n2, 3);
kpeter@374:   checkGraphIncEdgeArcLists(G, n3, 3);
kpeter@374:   checkGraphIncEdgeArcLists(G, n4, 2);
kpeter@374: 
kpeter@374:   checkGraphConEdgeList(G, 5);
kpeter@374:   checkGraphConArcList(G, 10);
kpeter@374: 
kpeter@374:   // Check contract()
kpeter@374:   G.contract(n1, n4, false);
kpeter@374: 
kpeter@374:   checkGraphNodeList(G, 3);
kpeter@374:   checkGraphEdgeList(G, 5);
kpeter@374:   checkGraphArcList(G, 10);
kpeter@374: 
kpeter@374:   checkGraphIncEdgeArcLists(G, n1, 4);
kpeter@374:   checkGraphIncEdgeArcLists(G, n2, 3);
kpeter@374:   checkGraphIncEdgeArcLists(G, n3, 3);
kpeter@374: 
kpeter@374:   checkGraphConEdgeList(G, 5);
kpeter@374:   checkGraphConArcList(G, 10);
kpeter@374: 
kpeter@374:   G.contract(n2, n3);
kpeter@374: 
kpeter@374:   checkGraphNodeList(G, 2);
kpeter@374:   checkGraphEdgeList(G, 3);
kpeter@374:   checkGraphArcList(G, 6);
kpeter@374: 
kpeter@374:   checkGraphIncEdgeArcLists(G, n1, 4);
kpeter@374:   checkGraphIncEdgeArcLists(G, n2, 2);
kpeter@374: 
kpeter@374:   checkGraphConEdgeList(G, 3);
kpeter@374:   checkGraphConArcList(G, 6);
kpeter@374: }
kpeter@374: 
kpeter@374: template <class Graph>
kpeter@374: void checkGraphErase() {
kpeter@374:   TEMPLATE_GRAPH_TYPEDEFS(Graph);
kpeter@374: 
kpeter@374:   Graph G;
kpeter@374:   Node n1 = G.addNode(), n2 = G.addNode(),
kpeter@374:        n3 = G.addNode(), n4 = G.addNode();
kpeter@374:   Edge e1 = G.addEdge(n1, n2), e2 = G.addEdge(n2, n1),
kpeter@374:        e3 = G.addEdge(n2, n3), e4 = G.addEdge(n1, n4),
kpeter@374:        e5 = G.addEdge(n4, n3);
kpeter@374: 
kpeter@374:   // Check edge deletion
kpeter@374:   G.erase(e2);
kpeter@374: 
kpeter@374:   checkGraphNodeList(G, 4);
kpeter@374:   checkGraphEdgeList(G, 4);
kpeter@374:   checkGraphArcList(G, 8);
kpeter@374: 
kpeter@374:   checkGraphIncEdgeArcLists(G, n1, 2);
kpeter@374:   checkGraphIncEdgeArcLists(G, n2, 2);
kpeter@374:   checkGraphIncEdgeArcLists(G, n3, 2);
kpeter@374:   checkGraphIncEdgeArcLists(G, n4, 2);
kpeter@374: 
kpeter@374:   checkGraphConEdgeList(G, 4);
kpeter@374:   checkGraphConArcList(G, 8);
kpeter@374: 
kpeter@374:   // Check node deletion
kpeter@374:   G.erase(n3);
kpeter@374: 
kpeter@374:   checkGraphNodeList(G, 3);
kpeter@374:   checkGraphEdgeList(G, 2);
kpeter@374:   checkGraphArcList(G, 4);
kpeter@374: 
kpeter@374:   checkGraphIncEdgeArcLists(G, n1, 2);
kpeter@374:   checkGraphIncEdgeArcLists(G, n2, 1);
kpeter@374:   checkGraphIncEdgeArcLists(G, n4, 1);
kpeter@374: 
kpeter@374:   checkGraphConEdgeList(G, 2);
kpeter@374:   checkGraphConArcList(G, 4);
kpeter@374: }
kpeter@374: 
kpeter@374: 
kpeter@374: template <class Graph>
kpeter@374: void checkGraphSnapshot() {
kpeter@374:   TEMPLATE_GRAPH_TYPEDEFS(Graph);
kpeter@374: 
kpeter@374:   Graph G;
kpeter@374:   Node n1 = G.addNode(), n2 = G.addNode(), n3 = G.addNode();
kpeter@374:   Edge e1 = G.addEdge(n1, n2), e2 = G.addEdge(n2, n1),
kpeter@374:        e3 = G.addEdge(n2, n3);
kpeter@374: 
kpeter@374:   checkGraphNodeList(G, 3);
kpeter@374:   checkGraphEdgeList(G, 3);
kpeter@374:   checkGraphArcList(G, 6);
kpeter@374: 
kpeter@374:   typename Graph::Snapshot snapshot(G);
kpeter@374: 
kpeter@374:   Node n = G.addNode();
kpeter@374:   G.addEdge(n3, n);
kpeter@374:   G.addEdge(n, n3);
kpeter@374:   G.addEdge(n3, n2);
kpeter@374: 
kpeter@374:   checkGraphNodeList(G, 4);
kpeter@374:   checkGraphEdgeList(G, 6);
kpeter@374:   checkGraphArcList(G, 12);
kpeter@374: 
kpeter@374:   snapshot.restore();
kpeter@374: 
kpeter@374:   checkGraphNodeList(G, 3);
kpeter@374:   checkGraphEdgeList(G, 3);
kpeter@374:   checkGraphArcList(G, 6);
kpeter@374: 
kpeter@374:   checkGraphIncEdgeArcLists(G, n1, 2);
kpeter@374:   checkGraphIncEdgeArcLists(G, n2, 3);
kpeter@374:   checkGraphIncEdgeArcLists(G, n3, 1);
kpeter@374: 
kpeter@374:   checkGraphConEdgeList(G, 3);
kpeter@374:   checkGraphConArcList(G, 6);
kpeter@374: 
kpeter@374:   checkNodeIds(G);
kpeter@374:   checkEdgeIds(G);
kpeter@374:   checkArcIds(G);
kpeter@374:   checkGraphNodeMap(G);
kpeter@374:   checkGraphEdgeMap(G);
kpeter@374:   checkGraphArcMap(G);
kpeter@374: 
kpeter@374:   G.addNode();
kpeter@374:   snapshot.save(G);
kpeter@374: 
kpeter@374:   G.addEdge(G.addNode(), G.addNode());
kpeter@374: 
kpeter@374:   snapshot.restore();
kpeter@374: 
kpeter@374:   checkGraphNodeList(G, 4);
kpeter@374:   checkGraphEdgeList(G, 3);
kpeter@374:   checkGraphArcList(G, 6);
kpeter@374: }
kpeter@374: 
deba@353: void checkFullGraph(int num) {
deba@353:   typedef FullGraph Graph;
deba@353:   GRAPH_TYPEDEFS(Graph);
deba@353: 
deba@353:   Graph G(num);
kpeter@737:   check(G.nodeNum() == num && G.edgeNum() == num * (num - 1) / 2,
kpeter@737:         "Wrong size");
kpeter@737: 
kpeter@737:   G.resize(num);
kpeter@737:   check(G.nodeNum() == num && G.edgeNum() == num * (num - 1) / 2,
kpeter@737:         "Wrong size");
kpeter@737: 
deba@353:   checkGraphNodeList(G, num);
deba@353:   checkGraphEdgeList(G, num * (num - 1) / 2);
deba@353: 
deba@353:   for (NodeIt n(G); n != INVALID; ++n) {
kpeter@365:     checkGraphOutArcList(G, n, num - 1);
kpeter@365:     checkGraphInArcList(G, n, num - 1);
kpeter@365:     checkGraphIncEdgeList(G, n, num - 1);
deba@353:   }
deba@353: 
deba@353:   checkGraphConArcList(G, num * (num - 1));
deba@353:   checkGraphConEdgeList(G, num * (num - 1) / 2);
deba@353: 
deba@353:   checkArcDirections(G);
deba@353: 
deba@353:   checkNodeIds(G);
deba@353:   checkArcIds(G);
deba@353:   checkEdgeIds(G);
deba@353:   checkGraphNodeMap(G);
deba@353:   checkGraphArcMap(G);
deba@353:   checkGraphEdgeMap(G);
deba@353: 
kpeter@365: 
deba@353:   for (int i = 0; i < G.nodeNum(); ++i) {
deba@353:     check(G.index(G(i)) == i, "Wrong index");
deba@353:   }
deba@353: 
deba@353:   for (NodeIt u(G); u != INVALID; ++u) {
deba@353:     for (NodeIt v(G); v != INVALID; ++v) {
deba@353:       Edge e = G.edge(u, v);
deba@353:       Arc a = G.arc(u, v);
deba@353:       if (u == v) {
deba@353:         check(e == INVALID, "Wrong edge lookup");
deba@353:         check(a == INVALID, "Wrong arc lookup");
deba@353:       } else {
deba@353:         check((G.u(e) == u && G.v(e) == v) ||
deba@353:               (G.u(e) == v && G.v(e) == u), "Wrong edge lookup");
deba@353:         check(G.source(a) == u && G.target(a) == v, "Wrong arc lookup");
deba@353:       }
deba@353:     }
deba@353:   }
deba@353: }
deba@353: 
deba@228: void checkConcepts() {
kpeter@171:   { // Checking graph components
deba@57:     checkConcept<BaseGraphComponent, BaseGraphComponent >();
deba@57: 
alpar@209:     checkConcept<IDableGraphComponent<>,
deba@57:       IDableGraphComponent<> >();
deba@57: 
alpar@209:     checkConcept<IterableGraphComponent<>,
deba@57:       IterableGraphComponent<> >();
deba@57: 
alpar@209:     checkConcept<MappableGraphComponent<>,
deba@57:       MappableGraphComponent<> >();
deba@57:   }
kpeter@171:   { // Checking skeleton graph
kpeter@171:     checkConcept<Graph, Graph>();
deba@57:   }
kpeter@171:   { // Checking ListGraph
kpeter@171:     checkConcept<Graph, ListGraph>();
kpeter@171:     checkConcept<AlterableGraphComponent<>, ListGraph>();
kpeter@171:     checkConcept<ExtendableGraphComponent<>, ListGraph>();
kpeter@171:     checkConcept<ClearableGraphComponent<>, ListGraph>();
kpeter@171:     checkConcept<ErasableGraphComponent<>, ListGraph>();
kpeter@171:   }
kpeter@171:   { // Checking SmartGraph
kpeter@171:     checkConcept<Graph, SmartGraph>();
kpeter@171:     checkConcept<AlterableGraphComponent<>, SmartGraph>();
kpeter@171:     checkConcept<ExtendableGraphComponent<>, SmartGraph>();
kpeter@171:     checkConcept<ClearableGraphComponent<>, SmartGraph>();
kpeter@171:   }
deba@353:   { // Checking FullGraph
deba@353:     checkConcept<Graph, FullGraph>();
deba@353:   }
kpeter@334:   { // Checking GridGraph
kpeter@334:     checkConcept<Graph, GridGraph>();
kpeter@334:   }
kpeter@365:   { // Checking HypercubeGraph
kpeter@365:     checkConcept<Graph, HypercubeGraph>();
kpeter@365:   }
deba@57: }
deba@57: 
deba@57: template <typename Graph>
deba@228: void checkGraphValidity() {
deba@149:   TEMPLATE_GRAPH_TYPEDEFS(Graph);
deba@57:   Graph g;
deba@57: 
deba@57:   Node
deba@57:     n1 = g.addNode(),
deba@57:     n2 = g.addNode(),
deba@57:     n3 = g.addNode();
deba@57: 
deba@57:   Edge
deba@57:     e1 = g.addEdge(n1, n2),
deba@57:     e2 = g.addEdge(n2, n3);
deba@57: 
kpeter@171:   check(g.valid(n1), "Wrong validity check");
kpeter@171:   check(g.valid(e1), "Wrong validity check");
kpeter@171:   check(g.valid(g.direct(e1, true)), "Wrong validity check");
kpeter@171: 
kpeter@171:   check(!g.valid(g.nodeFromId(-1)), "Wrong validity check");
kpeter@171:   check(!g.valid(g.edgeFromId(-1)), "Wrong validity check");
kpeter@171:   check(!g.valid(g.arcFromId(-1)), "Wrong validity check");
deba@57: }
deba@57: 
deba@149: template <typename Graph>
deba@228: void checkGraphValidityErase() {
deba@149:   TEMPLATE_GRAPH_TYPEDEFS(Graph);
deba@149:   Graph g;
deba@149: 
deba@149:   Node
deba@149:     n1 = g.addNode(),
deba@149:     n2 = g.addNode(),
deba@149:     n3 = g.addNode();
deba@149: 
deba@149:   Edge
deba@149:     e1 = g.addEdge(n1, n2),
deba@149:     e2 = g.addEdge(n2, n3);
deba@149: 
kpeter@171:   check(g.valid(n1), "Wrong validity check");
kpeter@171:   check(g.valid(e1), "Wrong validity check");
kpeter@171:   check(g.valid(g.direct(e1, true)), "Wrong validity check");
deba@149: 
deba@149:   g.erase(n1);
deba@149: 
kpeter@171:   check(!g.valid(n1), "Wrong validity check");
kpeter@171:   check(g.valid(n2), "Wrong validity check");
kpeter@171:   check(g.valid(n3), "Wrong validity check");
kpeter@171:   check(!g.valid(e1), "Wrong validity check");
kpeter@171:   check(g.valid(e2), "Wrong validity check");
deba@149: 
kpeter@171:   check(!g.valid(g.nodeFromId(-1)), "Wrong validity check");
kpeter@171:   check(!g.valid(g.edgeFromId(-1)), "Wrong validity check");
kpeter@171:   check(!g.valid(g.arcFromId(-1)), "Wrong validity check");
deba@149: }
deba@149: 
deba@335: void checkGridGraph(int width, int height) {
deba@335:   typedef GridGraph Graph;
deba@335:   GRAPH_TYPEDEFS(Graph);
deba@335:   Graph G(width, height);
deba@57: 
kpeter@336:   check(G.width() == width, "Wrong column number");
kpeter@336:   check(G.height() == height, "Wrong row number");
alpar@209: 
kpeter@737:   G.resize(width, height);
kpeter@737:   check(G.width() == width, "Wrong column number");
kpeter@737:   check(G.height() == height, "Wrong row number");
kpeter@737: 
deba@335:   for (int i = 0; i < width; ++i) {
deba@335:     for (int j = 0; j < height; ++j) {
deba@335:       check(G.col(G(i, j)) == i, "Wrong column");
deba@335:       check(G.row(G(i, j)) == j, "Wrong row");
deba@335:       check(G.pos(G(i, j)).x == i, "Wrong column");
deba@335:       check(G.pos(G(i, j)).y == j, "Wrong row");
kpeter@334:     }
kpeter@334:   }
deba@57: 
deba@335:   for (int j = 0; j < height; ++j) {
deba@335:     for (int i = 0; i < width - 1; ++i) {
deba@335:       check(G.source(G.right(G(i, j))) == G(i, j), "Wrong right");
deba@335:       check(G.target(G.right(G(i, j))) == G(i + 1, j), "Wrong right");
kpeter@334:     }
deba@335:     check(G.right(G(width - 1, j)) == INVALID, "Wrong right");
kpeter@334:   }
deba@57: 
deba@335:   for (int j = 0; j < height; ++j) {
deba@335:     for (int i = 1; i < width; ++i) {
deba@335:       check(G.source(G.left(G(i, j))) == G(i, j), "Wrong left");
deba@335:       check(G.target(G.left(G(i, j))) == G(i - 1, j), "Wrong left");
kpeter@334:     }
deba@335:     check(G.left(G(0, j)) == INVALID, "Wrong left");
kpeter@334:   }
deba@57: 
deba@335:   for (int i = 0; i < width; ++i) {
deba@335:     for (int j = 0; j < height - 1; ++j) {
deba@335:       check(G.source(G.up(G(i, j))) == G(i, j), "Wrong up");
deba@335:       check(G.target(G.up(G(i, j))) == G(i, j + 1), "Wrong up");
kpeter@334:     }
deba@335:     check(G.up(G(i, height - 1)) == INVALID, "Wrong up");
kpeter@334:   }
deba@228: 
deba@335:   for (int i = 0; i < width; ++i) {
deba@335:     for (int j = 1; j < height; ++j) {
deba@335:       check(G.source(G.down(G(i, j))) == G(i, j), "Wrong down");
deba@335:       check(G.target(G.down(G(i, j))) == G(i, j - 1), "Wrong down");
kpeter@334:     }
deba@335:     check(G.down(G(i, 0)) == INVALID, "Wrong down");
kpeter@334:   }
kpeter@334: 
deba@335:   checkGraphNodeList(G, width * height);
deba@335:   checkGraphEdgeList(G, width * (height - 1) + (width - 1) * height);
deba@335:   checkGraphArcList(G, 2 * (width * (height - 1) + (width - 1) * height));
kpeter@334: 
deba@335:   for (NodeIt n(G); n != INVALID; ++n) {
deba@335:     int nb = 4;
deba@335:     if (G.col(n) == 0) --nb;
deba@335:     if (G.col(n) == width - 1) --nb;
deba@335:     if (G.row(n) == 0) --nb;
deba@335:     if (G.row(n) == height - 1) --nb;
kpeter@334: 
deba@335:     checkGraphOutArcList(G, n, nb);
deba@335:     checkGraphInArcList(G, n, nb);
deba@335:     checkGraphIncEdgeList(G, n, nb);
deba@335:   }
kpeter@334: 
deba@335:   checkArcDirections(G);
kpeter@334: 
deba@335:   checkGraphConArcList(G, 2 * (width * (height - 1) + (width - 1) * height));
deba@335:   checkGraphConEdgeList(G, width * (height - 1) + (width - 1) * height);
kpeter@334: 
deba@335:   checkNodeIds(G);
deba@335:   checkArcIds(G);
deba@335:   checkEdgeIds(G);
deba@335:   checkGraphNodeMap(G);
deba@335:   checkGraphArcMap(G);
deba@335:   checkGraphEdgeMap(G);
kpeter@334: 
kpeter@334: }
deba@228: 
kpeter@365: void checkHypercubeGraph(int dim) {
kpeter@365:   GRAPH_TYPEDEFS(HypercubeGraph);
kpeter@365: 
kpeter@365:   HypercubeGraph G(dim);
kpeter@737:   check(G.dimension() == dim, "Wrong dimension");
kpeter@737: 
kpeter@737:   G.resize(dim);
kpeter@737:   check(G.dimension() == dim, "Wrong dimension");
kpeter@737:   
kpeter@365:   checkGraphNodeList(G, 1 << dim);
alpar@372:   checkGraphEdgeList(G, dim * (1 << (dim-1)));
kpeter@365:   checkGraphArcList(G, dim * (1 << dim));
kpeter@365: 
kpeter@365:   Node n = G.nodeFromId(dim);
kpeter@365: 
kpeter@365:   for (NodeIt n(G); n != INVALID; ++n) {
kpeter@365:     checkGraphIncEdgeList(G, n, dim);
kpeter@365:     for (IncEdgeIt e(G, n); e != INVALID; ++e) {
kpeter@365:       check( (G.u(e) == n &&
alpar@372:               G.id(G.v(e)) == (G.id(n) ^ (1 << G.dimension(e)))) ||
kpeter@365:              (G.v(e) == n &&
alpar@372:               G.id(G.u(e)) == (G.id(n) ^ (1 << G.dimension(e)))),
kpeter@365:              "Wrong edge or wrong dimension");
kpeter@365:     }
kpeter@365: 
kpeter@365:     checkGraphOutArcList(G, n, dim);
kpeter@365:     for (OutArcIt a(G, n); a != INVALID; ++a) {
kpeter@365:       check(G.source(a) == n &&
alpar@372:             G.id(G.target(a)) == (G.id(n) ^ (1 << G.dimension(a))),
kpeter@365:             "Wrong arc or wrong dimension");
kpeter@365:     }
kpeter@365: 
kpeter@365:     checkGraphInArcList(G, n, dim);
kpeter@365:     for (InArcIt a(G, n); a != INVALID; ++a) {
kpeter@365:       check(G.target(a) == n &&
alpar@372:             G.id(G.source(a)) == (G.id(n) ^ (1 << G.dimension(a))),
kpeter@365:             "Wrong arc or wrong dimension");
kpeter@365:     }
kpeter@365:   }
kpeter@365: 
kpeter@365:   checkGraphConArcList(G, (1 << dim) * dim);
alpar@372:   checkGraphConEdgeList(G, dim * (1 << (dim-1)));
kpeter@365: 
kpeter@365:   checkArcDirections(G);
kpeter@365: 
kpeter@365:   checkNodeIds(G);
kpeter@365:   checkArcIds(G);
kpeter@365:   checkEdgeIds(G);
kpeter@365:   checkGraphNodeMap(G);
kpeter@365:   checkGraphArcMap(G);
kpeter@365:   checkGraphEdgeMap(G);
kpeter@365: }
deba@57: 
deba@228: void checkGraphs() {
kpeter@171:   { // Checking ListGraph
kpeter@374:     checkGraphBuild<ListGraph>();
kpeter@374:     checkGraphAlter<ListGraph>();
kpeter@374:     checkGraphErase<ListGraph>();
kpeter@374:     checkGraphSnapshot<ListGraph>();
deba@228:     checkGraphValidityErase<ListGraph>();
kpeter@171:   }
kpeter@171:   { // Checking SmartGraph
kpeter@374:     checkGraphBuild<SmartGraph>();
kpeter@374:     checkGraphSnapshot<SmartGraph>();
deba@228:     checkGraphValidity<SmartGraph>();
kpeter@171:   }
kpeter@365:   { // Checking FullGraph
deba@353:     checkFullGraph(7);
deba@353:     checkFullGraph(8);
deba@353:   }
kpeter@334:   { // Checking GridGraph
deba@335:     checkGridGraph(5, 8);
deba@335:     checkGridGraph(8, 5);
deba@335:     checkGridGraph(5, 5);
deba@335:     checkGridGraph(0, 0);
deba@335:     checkGridGraph(1, 1);
kpeter@334:   }
kpeter@365:   { // Checking HypercubeGraph
kpeter@365:     checkHypercubeGraph(1);
kpeter@365:     checkHypercubeGraph(2);
kpeter@365:     checkHypercubeGraph(3);
kpeter@365:     checkHypercubeGraph(4);
kpeter@365:   }
kpeter@171: }
kpeter@171: 
deba@57: int main() {
deba@228:   checkConcepts();
deba@228:   checkGraphs();
deba@57:   return 0;
deba@57: }