kpeter@171: /* -*- C++ -*-
kpeter@171:  *
kpeter@171:  * This file is a part of LEMON, a generic C++ optimization library
kpeter@171:  *
kpeter@171:  * Copyright (C) 2003-2008
kpeter@171:  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
kpeter@171:  * (Egervary Research Group on Combinatorial Optimization, EGRES).
kpeter@171:  *
kpeter@171:  * Permission to use, modify and distribute this software is granted
kpeter@171:  * provided that this copyright notice appears in all copies. For
kpeter@171:  * precise terms see the accompanying LICENSE file.
kpeter@171:  *
kpeter@171:  * This software is provided "AS IS" with no warranty of any kind,
kpeter@171:  * express or implied, and with no claim as to its suitability for any
kpeter@171:  * purpose.
kpeter@171:  *
kpeter@171:  */
kpeter@171: 
kpeter@171: #ifndef LEMON_TEST_GRAPH_TEST_H
kpeter@171: #define LEMON_TEST_GRAPH_TEST_H
kpeter@171: 
kpeter@171: #include <lemon/graph_utils.h>
kpeter@171: #include "test_tools.h"
kpeter@171: 
kpeter@171: namespace lemon {
kpeter@171: 
kpeter@171:   template<class Graph>
kpeter@171:   void checkGraphNodeList(const Graph &G, int cnt)
kpeter@171:   {
kpeter@171:     typename Graph::NodeIt n(G);
kpeter@171:     for(int i=0;i<cnt;i++) {
kpeter@171:       check(n!=INVALID,"Wrong Node list linking.");
kpeter@171:       ++n;
kpeter@171:     }
kpeter@171:     check(n==INVALID,"Wrong Node list linking.");
kpeter@171:     check(countNodes(G)==cnt,"Wrong Node number.");
kpeter@171:   }
kpeter@171: 
kpeter@171:   template<class Graph>
kpeter@171:   void checkGraphArcList(const Graph &G, int cnt)
kpeter@171:   {
kpeter@171:     typename Graph::ArcIt e(G);
kpeter@171:     for(int i=0;i<cnt;i++) {
kpeter@171:       check(e!=INVALID,"Wrong Arc list linking.");
kpeter@171:       ++e;
kpeter@171:     }
kpeter@171:     check(e==INVALID,"Wrong Arc list linking.");
kpeter@171:     check(countArcs(G)==cnt,"Wrong Arc number.");
kpeter@171:   }
kpeter@171: 
kpeter@171:   template<class Graph>
kpeter@171:   void checkGraphOutArcList(const Graph &G, typename Graph::Node n, int cnt)
kpeter@171:   {
kpeter@171:     typename Graph::OutArcIt e(G,n);
kpeter@171:     for(int i=0;i<cnt;i++) {
kpeter@171:       check(e!=INVALID,"Wrong OutArc list linking.");
kpeter@171:       check(n==G.source(e),"Wrong OutArc list linking.");
kpeter@171:       ++e;
kpeter@171:     }
kpeter@171:     check(e==INVALID,"Wrong OutArc list linking.");
kpeter@171:     check(countOutArcs(G,n)==cnt,"Wrong OutArc number.");
kpeter@171:   }
kpeter@171: 
kpeter@171:   template<class Graph>
kpeter@171:   void checkGraphInArcList(const Graph &G, typename Graph::Node n, int cnt)
kpeter@171:   {
kpeter@171:     typename Graph::InArcIt e(G,n);
kpeter@171:     for(int i=0;i<cnt;i++) {
kpeter@171:       check(e!=INVALID,"Wrong InArc list linking.");
kpeter@171:       check(n==G.target(e),"Wrong InArc list linking.");
kpeter@171:       ++e;
kpeter@171:     }
kpeter@171:     check(e==INVALID,"Wrong InArc list linking.");
kpeter@171:     check(countInArcs(G,n)==cnt,"Wrong InArc number.");
kpeter@171:   }
kpeter@171: 
kpeter@171:   template<class Graph>
kpeter@171:   void checkGraphEdgeList(const Graph &G, int cnt)
kpeter@171:   {
kpeter@171:     typename Graph::EdgeIt e(G);
kpeter@171:     for(int i=0;i<cnt;i++) {
kpeter@171:       check(e!=INVALID,"Wrong Edge list linking.");
kpeter@171:       ++e;
kpeter@171:     }
kpeter@171:     check(e==INVALID,"Wrong Edge list linking.");
kpeter@171:     check(countEdges(G)==cnt,"Wrong Edge number.");
kpeter@171:   }
kpeter@171: 
kpeter@171:   template<class Graph>
kpeter@171:   void checkGraphIncEdgeList(const Graph &G, typename Graph::Node n, int cnt)
kpeter@171:   {
kpeter@171:     typename Graph::IncEdgeIt e(G,n);
kpeter@171:     for(int i=0;i<cnt;i++) {
kpeter@171:       check(e!=INVALID,"Wrong IncEdge list linking.");
kpeter@171:       check(n==G.u(e) || n==G.v(e),"Wrong IncEdge list linking.");
kpeter@171:       ++e;
kpeter@171:     }
kpeter@171:     check(e==INVALID,"Wrong IncEdge list linking.");
kpeter@171:     check(countIncEdges(G,n)==cnt,"Wrong IncEdge number.");
kpeter@171:   }
kpeter@171: 
kpeter@171:   template <class Digraph>
kpeter@171:   void checkDigraphIterators() {
kpeter@171:     typedef typename Digraph::Node Node;
kpeter@171:     typedef typename Digraph::NodeIt NodeIt;
kpeter@171:     typedef typename Digraph::Arc Arc;
kpeter@171:     typedef typename Digraph::ArcIt ArcIt;
kpeter@171:     typedef typename Digraph::InArcIt InArcIt;
kpeter@171:     typedef typename Digraph::OutArcIt OutArcIt;
kpeter@171:   }
kpeter@171: 
kpeter@171:   template <class Graph>
kpeter@171:   void checkGraphIterators() {
kpeter@171:     checkDigraphIterators<Graph>();
kpeter@171:     typedef typename Graph::Edge Edge;
kpeter@171:     typedef typename Graph::EdgeIt EdgeIt;
kpeter@171:     typedef typename Graph::IncEdgeIt IncEdgeIt;
kpeter@171:   }
kpeter@171: 
kpeter@171:   // Structure returned by addPetersen()
kpeter@171:   template<class Digraph>
kpeter@171:   struct PetStruct
kpeter@171:   {
kpeter@171:     // Vector containing the outer nodes
kpeter@171:     std::vector<typename Digraph::Node> outer;
kpeter@171:     // Vector containing the inner nodes
kpeter@171:     std::vector<typename Digraph::Node> inner;
kpeter@171:     // Vector containing the arcs of the inner circle
kpeter@171:     std::vector<typename Digraph::Arc> incir;
kpeter@171:     // Vector containing the arcs of the outer circle
kpeter@171:     std::vector<typename Digraph::Arc> outcir;
kpeter@171:     // Vector containing the chord arcs
kpeter@171:     std::vector<typename Digraph::Arc> chords;
kpeter@171:   };
kpeter@171: 
kpeter@171:   // Adds the reverse pair of all arcs to a digraph
kpeter@171:   template<class Digraph>
kpeter@171:   void bidirDigraph(Digraph &G)
kpeter@171:   {
kpeter@171:     typedef typename Digraph::Arc Arc;
kpeter@171:     typedef typename Digraph::ArcIt ArcIt;
kpeter@171: 
kpeter@171:     std::vector<Arc> ee;
kpeter@171: 
kpeter@171:     for(ArcIt e(G);e!=INVALID;++e) ee.push_back(e);
kpeter@171: 
kpeter@171:     for(int i=0;i<int(ee.size());++i)
kpeter@171:       G.addArc(G.target(ee[i]),G.source(ee[i]));
kpeter@171:   }
kpeter@171: 
kpeter@171:   // Adds a Petersen digraph to G.
kpeter@171:   // Returns the nodes and arcs of the generated digraph.
kpeter@171:   template<typename Digraph>
kpeter@171:   PetStruct<Digraph> addPetersen(Digraph &G,int num = 5)
kpeter@171:   {
kpeter@171:     PetStruct<Digraph> n;
kpeter@171: 
kpeter@171:     for(int i=0;i<num;i++) {
kpeter@171:       n.outer.push_back(G.addNode());
kpeter@171:       n.inner.push_back(G.addNode());
kpeter@171:     }
kpeter@171: 
kpeter@171:     for(int i=0;i<num;i++) {
kpeter@171:       n.chords.push_back(G.addArc(n.outer[i],n.inner[i]));
kpeter@171:       n.outcir.push_back(G.addArc(n.outer[i],n.outer[(i+1) % num]));
kpeter@171:       n.incir.push_back(G.addArc(n.inner[i],n.inner[(i+2) % num]));
kpeter@171:     }
kpeter@171: 
kpeter@171:     return n;
kpeter@171:   }
kpeter@171: 
kpeter@171:   // Checks the bidirectioned Petersen digraph
kpeter@171:   template<class Digraph>
kpeter@171:   void checkBidirPetersen(const Digraph &G, int num = 5)
kpeter@171:   {
kpeter@171:     typedef typename Digraph::NodeIt NodeIt;
kpeter@171: 
kpeter@171:     checkGraphNodeList(G, 2 * num);
kpeter@171:     checkGraphArcList(G, 6 * num);
kpeter@171: 
kpeter@171:     for(NodeIt n(G);n!=INVALID;++n) {
kpeter@171:       checkGraphInArcList(G, n, 3);
kpeter@171:       checkGraphOutArcList(G, n, 3);
kpeter@171:     }
kpeter@171:   }
kpeter@171: 
kpeter@171:   // Structure returned by addUPetersen()
kpeter@171:   template<class Graph>
kpeter@171:   struct UPetStruct
kpeter@171:   {
kpeter@171:     // Vector containing the outer nodes
kpeter@171:     std::vector<typename Graph::Node> outer;
kpeter@171:     // Vector containing the inner nodes
kpeter@171:     std::vector<typename Graph::Node> inner;
kpeter@171:     // Vector containing the edges of the inner circle
kpeter@171:     std::vector<typename Graph::Edge> incir;
kpeter@171:     // Vector containing the edges of the outer circle
kpeter@171:     std::vector<typename Graph::Edge> outcir;
kpeter@171:     // Vector containing the chord edges
kpeter@171:     std::vector<typename Graph::Edge> chords;
kpeter@171:   };
kpeter@171: 
kpeter@171:   // Adds a Petersen graph to \c G.
kpeter@171:   // Returns the nodes and edges of the generated graph.
kpeter@171:   template<typename Graph>
kpeter@171:   UPetStruct<Graph> addUPetersen(Graph &G,int num=5)
kpeter@171:   {
kpeter@171:     UPetStruct<Graph> n;
kpeter@171: 
kpeter@171:     for(int i=0;i<num;i++) {
kpeter@171:       n.outer.push_back(G.addNode());
kpeter@171:       n.inner.push_back(G.addNode());
kpeter@171:     }
kpeter@171: 
kpeter@171:     for(int i=0;i<num;i++) {
kpeter@171:       n.chords.push_back(G.addEdge(n.outer[i],n.inner[i]));
kpeter@171:       n.outcir.push_back(G.addEdge(n.outer[i],n.outer[(i+1)%num]));
kpeter@171:       n.incir.push_back(G.addEdge(n.inner[i],n.inner[(i+2)%num]));
kpeter@171:     }
kpeter@171:     
kpeter@171:     return n;
kpeter@171:   }
kpeter@171: 
kpeter@171:   // Checks the undirected Petersen graph
kpeter@171:   template<class Graph>
kpeter@171:   void checkUndirPetersen(const Graph &G, int num = 5)
kpeter@171:   {
kpeter@171:     typedef typename Graph::NodeIt NodeIt;
kpeter@171: 
kpeter@171:     checkGraphNodeList(G, 2 * num);
kpeter@171:     checkGraphEdgeList(G, 3 * num);
kpeter@171:     checkGraphArcList(G, 6 * num);
kpeter@171: 
kpeter@171:     for(NodeIt n(G);n!=INVALID;++n) {
kpeter@171:       checkGraphIncEdgeList(G, n, 3);
kpeter@171:     }
kpeter@171:   }
kpeter@171: 
kpeter@171:   template <class Digraph>
kpeter@171:   void checkDigraph() {
kpeter@171:     const int num = 5;
kpeter@171:     Digraph G;
kpeter@171:     checkGraphNodeList(G, 0);
kpeter@171:     checkGraphArcList(G, 0);
kpeter@171:     addPetersen(G, num);
kpeter@171:     bidirDigraph(G);
kpeter@171:     checkBidirPetersen(G, num);
kpeter@171:   }
kpeter@171:   
kpeter@171:   template <class Graph>
kpeter@171:   void checkGraph() {
kpeter@171:     const int num = 5;
kpeter@171:     Graph G;
kpeter@171:     checkGraphNodeList(G, 0);
kpeter@171:     checkGraphEdgeList(G, 0);
kpeter@171:     addUPetersen(G, num);
kpeter@171:     checkUndirPetersen(G, num);
kpeter@171:   }
kpeter@171: 
kpeter@171: } //namespace lemon
kpeter@171: 
kpeter@171: #endif