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@107:  * Copyright (C) 2003-2008
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@365: #include <lemon/full_graph.h>
deba@57: // #include <lemon/grid_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>
deba@228: void checkGraph() {
deba@228:   TEMPLATE_GRAPH_TYPEDEFS(Graph);
deba@228: 
deba@228:   Graph G;
deba@228:   checkGraphNodeList(G, 0);
deba@228:   checkGraphEdgeList(G, 0);
deba@228: 
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);
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");
deba@228:   checkGraphNodeList(G, 3);
deba@228:   checkGraphArcList(G, 2);
deba@228:   checkGraphEdgeList(G, 1);
deba@228: 
deba@228:   checkGraphOutArcList(G, n1, 1);
deba@228:   checkGraphOutArcList(G, n2, 1);
deba@228:   checkGraphOutArcList(G, n3, 0);
deba@228: 
deba@228:   checkGraphInArcList(G, n1, 1);
deba@228:   checkGraphInArcList(G, n2, 1);
deba@228:   checkGraphInArcList(G, n3, 0);
deba@228: 
deba@228:   checkGraphIncEdgeList(G, n1, 1);
deba@228:   checkGraphIncEdgeList(G, n2, 1);
deba@228:   checkGraphIncEdgeList(G, n3, 0);
deba@228: 
deba@228:   checkGraphConArcList(G, 2);
deba@228:   checkGraphConEdgeList(G, 1);
deba@228: 
deba@228:   Edge e2 = G.addEdge(n2, n1), e3 = G.addEdge(n2, n3);
deba@228:   checkGraphNodeList(G, 3);
deba@228:   checkGraphArcList(G, 6);
deba@228:   checkGraphEdgeList(G, 3);
deba@228: 
deba@228:   checkGraphOutArcList(G, n1, 2);
deba@228:   checkGraphOutArcList(G, n2, 3);
deba@228:   checkGraphOutArcList(G, n3, 1);
deba@228: 
deba@228:   checkGraphInArcList(G, n1, 2);
deba@228:   checkGraphInArcList(G, n2, 3);
deba@228:   checkGraphInArcList(G, n3, 1);
deba@228: 
deba@228:   checkGraphIncEdgeList(G, n1, 2);
deba@228:   checkGraphIncEdgeList(G, n2, 3);
deba@228:   checkGraphIncEdgeList(G, n3, 1);
deba@228: 
deba@228:   checkGraphConArcList(G, 6);
deba@228:   checkGraphConEdgeList(G, 3);
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: 
deba@365: void checkFullGraph(int num) {
deba@365:   typedef FullGraph Graph;
deba@365:   GRAPH_TYPEDEFS(Graph);
deba@365: 
deba@365:   Graph G(num);
deba@365:   checkGraphNodeList(G, num);
deba@365:   checkGraphEdgeList(G, num * (num - 1) / 2);
deba@365: 
deba@365:   for (NodeIt n(G); n != INVALID; ++n) {
deba@365:     checkGraphOutArcList(G, n, num - 1);    
deba@365:     checkGraphInArcList(G, n, num - 1);    
deba@365:     checkGraphIncEdgeList(G, n, num - 1);    
deba@365:   }
deba@365: 
deba@365:   checkGraphConArcList(G, num * (num - 1));
deba@365:   checkGraphConEdgeList(G, num * (num - 1) / 2);
deba@365: 
deba@365:   checkArcDirections(G);
deba@365: 
deba@365:   checkNodeIds(G);
deba@365:   checkArcIds(G);
deba@365:   checkEdgeIds(G);
deba@365:   checkGraphNodeMap(G);
deba@365:   checkGraphArcMap(G);
deba@365:   checkGraphEdgeMap(G);
deba@365: 
deba@365:   
deba@365:   for (int i = 0; i < G.nodeNum(); ++i) {
deba@365:     check(G.index(G(i)) == i, "Wrong index");
deba@365:   }
deba@365: 
deba@365:   for (NodeIt u(G); u != INVALID; ++u) {
deba@365:     for (NodeIt v(G); v != INVALID; ++v) {
deba@365:       Edge e = G.edge(u, v);
deba@365:       Arc a = G.arc(u, v);
deba@365:       if (u == v) {
deba@365:         check(e == INVALID, "Wrong edge lookup");
deba@365:         check(a == INVALID, "Wrong arc lookup");
deba@365:       } else {
deba@365:         check((G.u(e) == u && G.v(e) == v) ||
deba@365:               (G.u(e) == v && G.v(e) == u), "Wrong edge lookup");
deba@365:         check(G.source(a) == u && G.target(a) == v, "Wrong arc lookup");
deba@365:       }
deba@365:     }
deba@365:   }
deba@365: }
deba@365: 
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@365:   { // Checking FullGraph
deba@365:     checkConcept<Graph, FullGraph>();
deba@365:   }
deba@365: //   { // Checking GridGraph
deba@365: //     checkConcept<Graph, GridGraph>();
deba@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@57: // void checkGridGraph(const GridGraph& g, int w, int h) {
deba@57: //   check(g.width() == w, "Wrong width");
deba@57: //   check(g.height() == h, "Wrong height");
deba@57: 
deba@57: //   for (int i = 0; i < w; ++i) {
deba@57: //     for (int j = 0; j < h; ++j) {
deba@57: //       check(g.col(g(i, j)) == i, "Wrong col");
deba@57: //       check(g.row(g(i, j)) == j, "Wrong row");
deba@57: //     }
deba@57: //   }
alpar@209: 
deba@57: //   for (int i = 0; i < w; ++i) {
deba@57: //     for (int j = 0; j < h - 1; ++j) {
deba@57: //       check(g.source(g.down(g(i, j))) == g(i, j), "Wrong down");
deba@57: //       check(g.target(g.down(g(i, j))) == g(i, j + 1), "Wrong down");
deba@57: //     }
deba@57: //     check(g.down(g(i, h - 1)) == INVALID, "Wrong down");
deba@57: //   }
deba@57: 
deba@57: //   for (int i = 0; i < w; ++i) {
deba@57: //     for (int j = 1; j < h; ++j) {
deba@57: //       check(g.source(g.up(g(i, j))) == g(i, j), "Wrong up");
deba@57: //       check(g.target(g.up(g(i, j))) == g(i, j - 1), "Wrong up");
deba@57: //     }
deba@57: //     check(g.up(g(i, 0)) == INVALID, "Wrong up");
deba@57: //   }
deba@57: 
deba@57: //   for (int j = 0; j < h; ++j) {
deba@57: //     for (int i = 0; i < w - 1; ++i) {
deba@57: //       check(g.source(g.right(g(i, j))) == g(i, j), "Wrong right");
alpar@209: //       check(g.target(g.right(g(i, j))) == g(i + 1, j), "Wrong right");
deba@57: //     }
alpar@209: //     check(g.right(g(w - 1, j)) == INVALID, "Wrong right");
deba@57: //   }
deba@57: 
deba@57: //   for (int j = 0; j < h; ++j) {
deba@57: //     for (int i = 1; i < w; ++i) {
deba@57: //       check(g.source(g.left(g(i, j))) == g(i, j), "Wrong left");
alpar@209: //       check(g.target(g.left(g(i, j))) == g(i - 1, j), "Wrong left");
deba@57: //     }
alpar@209: //     check(g.left(g(0, j)) == INVALID, "Wrong left");
deba@57: //   }
deba@57: // }
deba@57: 
deba@228: void checkGraphs() {
kpeter@171:   { // Checking ListGraph
kpeter@171:     checkGraph<ListGraph>();
deba@228:     checkGraphValidityErase<ListGraph>();
kpeter@171:   }
kpeter@171:   { // Checking SmartGraph
kpeter@171:     checkGraph<SmartGraph>();
deba@228:     checkGraphValidity<SmartGraph>();
kpeter@171:   }
deba@365:   { // Checking FullGraph   
deba@365:     checkFullGraph(7);
deba@365:     checkFullGraph(8);
deba@365:   }
kpeter@171: //   { // Checking GridGraph
kpeter@171: //     GridGraph g(5, 6);
kpeter@171: //     checkGraphNodeList(g, 30);
kpeter@171: //     checkGraphEdgeList(g, 49);
kpeter@171: //     checkGridGraph(g, 5, 6);
kpeter@171: //   }
kpeter@171: }
kpeter@171: 
deba@57: int main() {
deba@228:   checkConcepts();
deba@228:   checkGraphs();
deba@57:   return 0;
deba@57: }