source: lemon-0.x/test/graph_adaptor_test.cc @ 1988:875fe3f689e0

/* -*- C++ -*-
 *
 * This file is a part of LEMON, a generic C++ optimization library
 *
 * Copyright (C) 2003-2006
 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
 * (Egervary Research Group on Combinatorial Optimization, EGRES).
 *
 * Permission to use, modify and distribute this software is granted
 * provided that this copyright notice appears in all copies. For
 * precise terms see the accompanying LICENSE file.
 *
 * This software is provided "AS IS" with no warranty of any kind,
 * express or implied, and with no claim as to its suitability for any
 * purpose.
 *
 */

#include<iostream>
#include<lemon/concept_check.h>

#include<lemon/smart_graph.h>
#include<lemon/concept/graph.h>
#include<lemon/concept/ugraph.h>

#include<lemon/list_graph.h>
#include<lemon/full_graph.h>
#include<lemon/graph_adaptor.h>
#include<lemon/ugraph_adaptor.h>

#include"test/test_tools.h"
#include"test/graph_test.h"

/**
\file
This test makes consistency checks of graph adaptors.

\todo More extensive tests are needed 
*/

using namespace lemon;
using namespace lemon::concept;



int main() 
{
  {
    typedef StaticGraph Graph;
    checkConcept<StaticGraph, GraphAdaptor<Graph> >();

    checkConcept<StaticGraph, RevGraphAdaptor<Graph> >();

    checkConcept<StaticGraph, SubGraphAdaptor<Graph, 
      Graph::NodeMap<bool> , Graph::EdgeMap<bool> > >();
    checkConcept<StaticGraph, NodeSubGraphAdaptor<Graph, 
      Graph::NodeMap<bool> > >();
    checkConcept<StaticGraph, EdgeSubGraphAdaptor<Graph, 
      Graph::EdgeMap<bool> > >();
    
    checkConcept<StaticGraph, SubBidirGraphAdaptor<Graph, 
      Graph::EdgeMap<bool>, Graph::EdgeMap<bool> > >();
    //    checkConcept<StaticGraph, BidirGraph<Graph> >();
    checkConcept<StaticGraph, ResGraphAdaptor<Graph, int, 
      Graph::EdgeMap<int>, Graph::EdgeMap<int> > >();

    checkConcept<StaticGraph, ErasingFirstGraphAdaptor<Graph, 
      Graph::NodeMap<Graph::Edge> > >(); 

    checkConcept<UGraph, UndirGraphAdaptor<Graph> >();

    checkConcept<UGraph, SubUGraphAdaptor<UGraph, 
      UGraph::NodeMap<bool> , UGraph::UEdgeMap<bool> > >();
    checkConcept<UGraph, NodeSubUGraphAdaptor<UGraph, 
      UGraph::NodeMap<bool> > >();
    checkConcept<UGraph, EdgeSubUGraphAdaptor<UGraph, 
      UGraph::UEdgeMap<bool> > >();

    checkConcept<StaticGraph, DirUGraphAdaptor<UGraph, 
      UGraph::UEdgeMap<bool> > >();
  }
  std::cout << __FILE__ ": All tests passed.\n";

  return 0;
}