blob: 540dddc2af9a254b719a080cfc640ddbd4691cf0 (
about) (
plain)
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
|
/* -*- mode: C++; indent-tabs-mode: nil; -*-
*
* This file is a part of LEMON, a generic C++ optimization library.
*
* Copyright (C) 2003-2009
* 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 <string>
#include <iostream>
#include <lemon/concepts/path.h>
#include <lemon/concepts/digraph.h>
#include <lemon/path.h>
#include <lemon/list_graph.h>
#include "test_tools.h"
using namespace std;
using namespace lemon;
void check_concepts() {
checkConcept<concepts::Path<ListDigraph>, concepts::Path<ListDigraph> >();
checkConcept<concepts::Path<ListDigraph>, Path<ListDigraph> >();
checkConcept<concepts::Path<ListDigraph>, SimplePath<ListDigraph> >();
checkConcept<concepts::Path<ListDigraph>, StaticPath<ListDigraph> >();
checkConcept<concepts::Path<ListDigraph>, ListPath<ListDigraph> >();
}
int main() {
check_concepts();
return 0;
}
|