COIN-OR::LEMON - Graph Library

source: lemon-0.x/test/graph_adaptor_test.cc @ 2231:06faf3f06d67

Last change on this file since 2231:06faf3f06d67 was 2231:06faf3f06d67, checked in by Balazs Dezso, 13 years ago

Some rearrangement of concepts and extenders
BpUGraph concepts and concept check test

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#include<lemon/concept/bpugraph.h>
26
27#include<lemon/list_graph.h>
28#include<lemon/full_graph.h>
29#include<lemon/graph_adaptor.h>
30#include<lemon/ugraph_adaptor.h>
31#include<lemon/bpugraph_adaptor.h>
32
33#include"test/test_tools.h"
34#include"test/graph_test.h"
35
36/**
37\file
38This test makes consistency checks of graph adaptors.
39
40\todo More extensive tests are needed
41*/
42
43using namespace lemon;
44using namespace lemon::concept;
45
46
47
48int main()
49{
50  {
51    typedef Graph Graph;
52    checkConcept<Graph, GraphAdaptor<Graph> >();
53
54    checkConcept<Graph, RevGraphAdaptor<Graph> >();
55
56    checkConcept<Graph, SubGraphAdaptor<Graph,
57      Graph::NodeMap<bool> , Graph::EdgeMap<bool> > >();
58    checkConcept<Graph, NodeSubGraphAdaptor<Graph,
59      Graph::NodeMap<bool> > >();
60    checkConcept<Graph, EdgeSubGraphAdaptor<Graph,
61      Graph::EdgeMap<bool> > >();
62   
63    checkConcept<Graph, ResGraphAdaptor<Graph, int,
64      Graph::EdgeMap<int>, Graph::EdgeMap<int> > >();
65
66    checkConcept<Graph, ErasingFirstGraphAdaptor<Graph,
67      Graph::NodeMap<Graph::Edge> > >();
68
69    checkConcept<UGraph, UndirGraphAdaptor<Graph> >();
70
71    checkConcept<UGraph, SubUGraphAdaptor<UGraph,
72      UGraph::NodeMap<bool> , UGraph::UEdgeMap<bool> > >();
73    checkConcept<UGraph, NodeSubUGraphAdaptor<UGraph,
74      UGraph::NodeMap<bool> > >();
75    checkConcept<UGraph, EdgeSubUGraphAdaptor<UGraph,
76      UGraph::UEdgeMap<bool> > >();
77
78    checkConcept<Graph, DirUGraphAdaptor<UGraph,
79      UGraph::UEdgeMap<bool> > >();
80
81    checkConcept<BpUGraph, BpUGraphAdaptor<BpUGraph> >();
82
83    checkConcept<BpUGraph, SwapBpUGraphAdaptor<BpUGraph> >();
84
85  }
86  std::cout << __FILE__ ": All tests passed.\n";
87
88  return 0;
89}
Note: See TracBrowser for help on using the repository browser.