COIN-OR::LEMON - Graph Library

source: lemon-0.x/test/graph_adaptor_test.cc @ 1980:a954b780e3ab

Last change on this file since 1980:a954b780e3ab was 1980:a954b780e3ab, checked in by Balazs Dezso, 15 years ago

Renaming to be convient to the naming of the adaptors
Concept checking of the ugraph adaptors

File size: 2.4 KB
Line 
1/* -*- C++ -*-
2 *
3 * This file is a part of LEMON, a generic C++ optimization library
4 *
5 * Copyright (C) 2003-2006
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7 * (Egervary Research Group on Combinatorial Optimization, EGRES).
8 *
9 * Permission to use, modify and distribute this software is granted
10 * provided that this copyright notice appears in all copies. For
11 * precise terms see the accompanying LICENSE file.
12 *
13 * This software is provided "AS IS" with no warranty of any kind,
14 * express or implied, and with no claim as to its suitability for any
15 * purpose.
16 *
17 */
18
19#include<iostream>
20#include<lemon/concept_check.h>
21
22#include<lemon/smart_graph.h>
23#include<lemon/concept/graph.h>
24#include<lemon/concept/ugraph.h>
25
26#include<lemon/list_graph.h>
27#include<lemon/full_graph.h>
28#include<lemon/graph_adaptor.h>
29#include<lemon/ugraph_adaptor.h>
30
31#include"test/test_tools.h"
32#include"test/graph_test.h"
33
34/**
35\file
36This test makes consistency checks of graph adaptors.
37
38\todo More extensive tests are needed
39*/
40
41using namespace lemon;
42using namespace lemon::concept;
43
44
45
46int main()
47{
48  {
49    typedef StaticGraph Graph;
50    checkConcept<StaticGraph, GraphAdaptor<Graph> >();
51
52    checkConcept<StaticGraph, RevGraphAdaptor<Graph> >();
53
54    checkConcept<StaticGraph, SubGraphAdaptor<Graph,
55      Graph::NodeMap<bool> , Graph::EdgeMap<bool> > >();
56    checkConcept<StaticGraph, NodeSubGraphAdaptor<Graph,
57      Graph::NodeMap<bool> > >();
58    checkConcept<StaticGraph, EdgeSubGraphAdaptor<Graph,
59      Graph::EdgeMap<bool> > >();
60   
61    checkConcept<StaticGraph, SubBidirGraphAdaptor<Graph,
62      Graph::EdgeMap<bool>, Graph::EdgeMap<bool> > >();
63    //    checkConcept<StaticGraph, BidirGraph<Graph> >();
64    checkConcept<StaticGraph, ResGraphAdaptor<Graph, int,
65      Graph::EdgeMap<int>, Graph::EdgeMap<int> > >();
66
67    checkConcept<StaticGraph, ErasingFirstGraphAdaptor<Graph,
68      Graph::NodeMap<Graph::Edge> > >();
69
70    checkConcept<UGraph, UndirGraphAdaptor<Graph> >();
71
72    checkConcept<UGraph, SubUGraphAdaptor<UGraph,
73      UGraph::NodeMap<bool> , UGraph::UEdgeMap<bool> > >();
74    checkConcept<UGraph, NodeSubUGraphAdaptor<UGraph,
75      UGraph::NodeMap<bool> > >();
76    checkConcept<UGraph, EdgeSubUGraphAdaptor<UGraph,
77      UGraph::UEdgeMap<bool> > >();
78
79    checkConcept<StaticGraph, DirUGraphAdaptor<UGraph,
80      UGraph::UEdgeMap<bool> > >();
81  }
82  std::cout << __FILE__ ": All tests passed.\n";
83
84  return 0;
85}
Note: See TracBrowser for help on using the repository browser.