Files @ r57:c1acf0018c0a

Location: LEMON/LEMON-main/test/digraph_test.cc

Load file history 
r57:c1acf0018c0a
2.2 KiB
text/x-c++src
Show annotation Show as raw Download as raw
gravatar
deba@inf.elte.hu
Port ListDigraph and ListGraph from svn -r 3433 Details: - port Digraph and Graph concepts - port ListDigraph and ListGraph - port Basic graph constructing tools - port Digraph and Graph tests
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
/* -*- C++ -*-

 *

 * This file is a part of LEMON, a generic C++ optimization library

 *

 * Copyright (C) 2003-2007

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Research Group on Combinatorial Optimization, EGRES).

 *

 * Permission to use, modify and distribute this software is granted

 * provided that this copyright notice appears in all copies. For

 * precise terms see the accompanying LICENSE file.

 *

 * This software is provided "AS IS" with no warranty of any kind,

 * express or implied, and with no claim as to its suitability for any

 * purpose.

 *

 */



#include <iostream>

#include <vector>



#include <lemon/concepts/digraph.h>

#include <lemon/list_graph.h>

//#include <lemon/smart_graph.h>

//#include <lemon/full_graph.h>

//#include <lemon/hypercube_graph.h>



#include "test_tools.h"

#include "digraph_test.h"

#include "map_test.h"





using namespace lemon;

using namespace lemon::concepts;





int main() {

  { // checking digraph components

    checkConcept<BaseDigraphComponent, BaseDigraphComponent >();



    checkConcept<IDableDigraphComponent<>, 

      IDableDigraphComponent<> >();



    checkConcept<IterableDigraphComponent<>, 

      IterableDigraphComponent<> >();



    checkConcept<MappableDigraphComponent<>, 

      MappableDigraphComponent<> >();



  }

  { // checking skeleton digraphs

    checkConcept<Digraph, Digraph>();

  }

  { // checking list digraph

    checkConcept<Digraph, ListDigraph >();

    checkConcept<AlterableDigraphComponent<>, ListDigraph>();

    checkConcept<ExtendableDigraphComponent<>, ListDigraph>();

    checkConcept<ClearableDigraphComponent<>, ListDigraph>();

    checkConcept<ErasableDigraphComponent<>, ListDigraph>();



    checkDigraph<ListDigraph>();

    checkGraphNodeMap<ListDigraph>();

    checkGraphArcMap<ListDigraph>();

  }

//   { // checking smart digraph

//     checkConcept<Digraph, SmartDigraph >();



//     checkDigraph<SmartDigraph>();

//     checkDigraphNodeMap<SmartDigraph>();

//     checkDigraphArcMap<SmartDigraph>();

//   }

//   { // checking full digraph

//     checkConcept<Digraph, FullDigraph >();

//   }

//   { // checking full digraph

//     checkConcept<Digraph, HyperCubeDigraph >();

//   }



  std::cout << __FILE__ ": All tests passed.\n";



  return 0;

}