deba@57: /* -*- C++ -*-
deba@57:  *
deba@57:  * 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@57: // #include <lemon/full_graph.h>
deba@57: // #include <lemon/grid_graph.h>
deba@57: 
deba@57: //#include <lemon/graph_utils.h>
deba@57: 
deba@57: #include "test_tools.h"
deba@57: 
deba@57: 
deba@57: using namespace lemon;
deba@57: using namespace lemon::concepts;
deba@57: 
deba@57: void check_concepts() {
deba@57: 
deba@57:   { // checking digraph components
deba@57:     checkConcept<BaseGraphComponent, BaseGraphComponent >();
deba@57: 
deba@57:     checkConcept<IDableGraphComponent<>, 
deba@57:       IDableGraphComponent<> >();
deba@57: 
deba@57:     checkConcept<IterableGraphComponent<>, 
deba@57:       IterableGraphComponent<> >();
deba@57: 
deba@57:     checkConcept<MappableGraphComponent<>, 
deba@57:       MappableGraphComponent<> >();
deba@57: 
deba@57:   }
deba@57:   {
deba@57:     checkConcept<Graph, ListGraph>();    
deba@109:     checkConcept<Graph, SmartGraph>();    
deba@57: //     checkConcept<Graph, FullGraph>();    
deba@57: //     checkConcept<Graph, Graph>();    
deba@57: //     checkConcept<Graph, GridGraph>();
deba@57:   }
deba@57: }
deba@57: 
deba@57: template <typename Graph>
deba@57: void check_item_counts(Graph &g, int n, int e) {
deba@57:   int nn = 0;
deba@57:   for (typename Graph::NodeIt it(g); it != INVALID; ++it) {
deba@57:     ++nn;
deba@57:   }
deba@57: 
deba@57:   check(nn == n, "Wrong node number.");
deba@57:   //  check(countNodes(g) == n, "Wrong node number.");
deba@57: 
deba@57:   int ee = 0;
deba@57:   for (typename Graph::ArcIt it(g); it != INVALID; ++it) {
deba@57:     ++ee;
deba@57:   }
deba@57: 
deba@57:   check(ee == 2*e, "Wrong arc number.");
deba@57:   //  check(countArcs(g) == 2*e, "Wrong arc number.");
deba@57: 
deba@57:   int uee = 0;
deba@57:   for (typename Graph::EdgeIt it(g); it != INVALID; ++it) {
deba@57:     ++uee;
deba@57:   }
deba@57: 
deba@57:   check(uee == e, "Wrong edge number.");
deba@57:   //  check(countEdges(g) == e, "Wrong edge number.");
deba@57: }
deba@57: 
deba@57: template <typename Graph>
deba@57: void print_items(Graph &g) {
deba@57: 
deba@57:   typedef typename Graph::NodeIt NodeIt;
deba@57:   typedef typename Graph::EdgeIt EdgeIt;
deba@57:   typedef typename Graph::ArcIt ArcIt;
deba@57: 
deba@57:   std::cout << "Nodes" << std::endl;
deba@57:   int i=0;
deba@57:   for(NodeIt it(g); it!=INVALID; ++it, ++i) {
deba@57:     std::cout << "  " << i << ": " << g.id(it) << std::endl;
deba@57:   }
deba@57: 
deba@57:   std::cout << "Edge" << std::endl;
deba@57:   i=0;
deba@57:   for(EdgeIt it(g); it!=INVALID; ++it, ++i) {
deba@57:     std::cout << "  " << i << ": " << g.id(it) 
deba@57: 	 << " (" << g.id(g.source(it)) << ", " << g.id(g.target(it)) 
deba@57: 	 << ")" << std::endl;
deba@57:   }
deba@57: 
deba@57:   std::cout << "Arc" << std::endl;
deba@57:   i=0;
deba@57:   for(ArcIt it(g); it!=INVALID; ++it, ++i) {
deba@57:     std::cout << "  " << i << ": " << g.id(it)
deba@57: 	 << " (" << g.id(g.source(it)) << ", " << g.id(g.target(it)) 
deba@57: 	 << ")" << std::endl;
deba@57:   }
deba@57: 
deba@57: }
deba@57: 
deba@57: template <typename Graph>
deba@57: void check_graph() {
deba@57: 
deba@57:   typedef typename Graph::Node Node;
deba@57:   typedef typename Graph::Edge Edge;
deba@57:   typedef typename Graph::Arc Arc;
deba@57:   typedef typename Graph::NodeIt NodeIt;
deba@57:   typedef typename Graph::EdgeIt EdgeIt;
deba@57:   typedef typename Graph::ArcIt ArcIt;
deba@57: 
deba@57:   Graph g;
deba@57: 
deba@57:   check_item_counts(g,0,0);
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: 
deba@57:   // print_items(g);
deba@57: 
deba@57:   check_item_counts(g,3,2);
deba@57: }
deba@57: 
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: //   }
deba@57:   
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");
deba@57: //       check(g.target(g.right(g(i, j))) == g(i + 1, j), "Wrong right");      
deba@57: //     }
deba@57: //     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");
deba@57: //       check(g.target(g.left(g(i, j))) == g(i - 1, j), "Wrong left");      
deba@57: //     }
deba@57: //     check(g.left(g(0, j)) == INVALID, "Wrong left");    
deba@57: //   }
deba@57: // }
deba@57: 
deba@57: int main() {
deba@57:   check_concepts();
deba@57: 
deba@57:   check_graph<ListGraph>();
deba@109:   check_graph<SmartGraph>();
deba@57: 
deba@57: //   {
deba@57: //     FullGraph g(5);
deba@57: //     check_item_counts(g, 5, 10);
deba@57: //   }
deba@57: 
deba@57: //   {
deba@57: //     GridGraph g(5, 6);
deba@57: //     check_item_counts(g, 30, 49);
deba@57: //     checkGridGraph(g, 5, 6);
deba@57: //   }
deba@57: 
deba@57:   std::cout << __FILE__ ": All tests passed.\n";
deba@57: 
deba@57:   return 0;
deba@57: }