COIN-OR::LEMON - Graph Library

source: lemon-0.x/test/graph_test.cc @ 2111:ea1fa1bc3f6d

Last change on this file since 2111:ea1fa1bc3f6d was 2111:ea1fa1bc3f6d, checked in by Balazs Dezso, 17 years ago

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

File size: 2.0 KB
RevLine 
[1956]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 */
[906]18
[946]19#include <iostream>
20#include <vector>
[578]21
[959]22#include <lemon/concept/graph.h>
[946]23#include <lemon/list_graph.h>
24#include <lemon/smart_graph.h>
25#include <lemon/full_graph.h>
[1712]26#include <lemon/hypercube_graph.h>
[567]27
[946]28#include "test_tools.h"
29#include "graph_test.h"
30#include "map_test.h"
[503]31
32
[921]33using namespace lemon;
[959]34using namespace lemon::concept;
[503]35
36
[946]37int main() {
38  { // checking graph components
[989]39    checkConcept<BaseGraphComponent, BaseGraphComponent >();
[503]40
[989]41    checkConcept<BaseIterableGraphComponent, BaseIterableGraphComponent >();
[503]42
[989]43    checkConcept<IDableGraphComponent, IDableGraphComponent >();
44    checkConcept<MaxIDableGraphComponent, MaxIDableGraphComponent >();
[503]45
[989]46    checkConcept<IterableGraphComponent, IterableGraphComponent >();
[503]47
[989]48    checkConcept<MappableGraphComponent, MappableGraphComponent >();
[793]49
[946]50  }
51  { // checking skeleton graphs
[2111]52    checkConcept<Graph, Graph >();
[946]53  }
54  { // checking list graph
[2111]55    checkConcept<Graph, ListGraph >();
[793]56
[946]57    checkGraph<ListGraph>();
58    checkGraphNodeMap<ListGraph>();
59    checkGraphEdgeMap<ListGraph>();
60  }
61  { // checking smart graph
[2111]62    checkConcept<Graph, SmartGraph >();
[733]63
[946]64    checkGraph<SmartGraph>();
65    checkGraphNodeMap<SmartGraph>();
66    checkGraphEdgeMap<SmartGraph>();
[503]67  }
[946]68  { // checking full graph
[2111]69    checkConcept<Graph, FullGraph >();
[578]70  }
[1712]71  { // checking full graph
[2111]72    checkConcept<Graph, HyperCubeGraph >();
[1712]73  }
[503]74
75  std::cout << __FILE__ ": All tests passed.\n";
76
[579]77  return 0;
[503]78}
Note: See TracBrowser for help on using the repository browser.