1 /* -*- mode: C++; indent-tabs-mode: nil; -*-
3 * This file is a part of LEMON, a generic C++ optimization library.
5 * Copyright (C) 2003-2010
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7 * (Egervary Research Group on Combinatorial Optimization, EGRES).
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.
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
19 #include <lemon/concepts/bpgraph.h>
20 //#include <lemon/list_graph.h>
21 //#include <lemon/smart_graph.h>
22 //#include <lemon/full_graph.h>
23 //#include <lemon/grid_graph.h>
24 //#include <lemon/hypercube_graph.h>
26 #include "test_tools.h"
27 #include "graph_test.h"
29 using namespace lemon;
30 using namespace lemon::concepts;
32 void checkConcepts() {
33 { // Checking graph components
34 checkConcept<BaseBpGraphComponent, BaseBpGraphComponent >();
36 checkConcept<IDableBpGraphComponent<>,
37 IDableBpGraphComponent<> >();
39 checkConcept<IterableBpGraphComponent<>,
40 IterableBpGraphComponent<> >();
42 checkConcept<AlterableBpGraphComponent<>,
43 AlterableBpGraphComponent<> >();
45 checkConcept<MappableBpGraphComponent<>,
46 MappableBpGraphComponent<> >();
48 checkConcept<ExtendableBpGraphComponent<>,
49 ExtendableBpGraphComponent<> >();
51 checkConcept<ErasableBpGraphComponent<>,
52 ErasableBpGraphComponent<> >();
54 checkConcept<ClearableGraphComponent<>,
55 ClearableGraphComponent<> >();
58 { // Checking skeleton graph
59 checkConcept<BpGraph, BpGraph>();