COIN-OR::LEMON - Graph Library

source: lemon-0.x/test/graph_adaptor_test.cc @ 2196:09af6d2b683b

Last change on this file since 2196:09af6d2b683b was 2111:ea1fa1bc3f6d, checked in by Balazs Dezso, 14 years ago

Removing concepts for extendable and erasable graphs
Renaming StaticGraph? to Graph

File size: 2.2 KB
RevLine 
[906]1/* -*- C++ -*-
2 *
[1956]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
[1359]7 * (Egervary Research Group on Combinatorial Optimization, EGRES).
[906]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
[849]19#include<iostream>
[946]20#include<lemon/concept_check.h>
21
[921]22#include<lemon/smart_graph.h>
[959]23#include<lemon/concept/graph.h>
[1909]24#include<lemon/concept/ugraph.h>
[946]25
[921]26#include<lemon/list_graph.h>
27#include<lemon/full_graph.h>
[1401]28#include<lemon/graph_adaptor.h>
[1980]29#include<lemon/ugraph_adaptor.h>
[849]30
[870]31#include"test/test_tools.h"
32#include"test/graph_test.h"
[849]33
34/**
35\file
[1401]36This test makes consistency checks of graph adaptors.
[849]37
[878]38\todo More extensive tests are needed
[849]39*/
40
[921]41using namespace lemon;
[959]42using namespace lemon::concept;
[849]43
44
45
46int main()
47{
[946]48  {
[2111]49    typedef Graph Graph;
50    checkConcept<Graph, GraphAdaptor<Graph> >();
[946]51
[2111]52    checkConcept<Graph, RevGraphAdaptor<Graph> >();
[946]53
[2111]54    checkConcept<Graph, SubGraphAdaptor<Graph,
[998]55      Graph::NodeMap<bool> , Graph::EdgeMap<bool> > >();
[2111]56    checkConcept<Graph, NodeSubGraphAdaptor<Graph,
[998]57      Graph::NodeMap<bool> > >();
[2111]58    checkConcept<Graph, EdgeSubGraphAdaptor<Graph,
[998]59      Graph::EdgeMap<bool> > >();
[992]60   
[2111]61    checkConcept<Graph, ResGraphAdaptor<Graph, int,
[998]62      Graph::EdgeMap<int>, Graph::EdgeMap<int> > >();
[946]63
[2111]64    checkConcept<Graph, ErasingFirstGraphAdaptor<Graph,
[998]65      Graph::NodeMap<Graph::Edge> > >();
[1383]66
[1980]67    checkConcept<UGraph, UndirGraphAdaptor<Graph> >();
68
69    checkConcept<UGraph, SubUGraphAdaptor<UGraph,
70      UGraph::NodeMap<bool> , UGraph::UEdgeMap<bool> > >();
71    checkConcept<UGraph, NodeSubUGraphAdaptor<UGraph,
72      UGraph::NodeMap<bool> > >();
73    checkConcept<UGraph, EdgeSubUGraphAdaptor<UGraph,
74      UGraph::UEdgeMap<bool> > >();
75
[2111]76    checkConcept<Graph, DirUGraphAdaptor<UGraph,
[1980]77      UGraph::UEdgeMap<bool> > >();
[946]78  }
[849]79  std::cout << __FILE__ ": All tests passed.\n";
80
81  return 0;
82}
Note: See TracBrowser for help on using the repository browser.