author | alpar |
Tue, 31 Oct 2006 08:39:01 +0000 | |
changeset 2279 | 2c3fee01d3ed |
parent 2111 | ea1fa1bc3f6d |
child 2391 | 14a343be7a5a |
permissions | -rw-r--r-- |
deba@1962 | 1 |
// -*- c++ -*- |
deba@1962 | 2 |
|
deba@1962 | 3 |
#include <iostream> |
deba@1962 | 4 |
#include <vector> |
deba@1962 | 5 |
|
alpar@2260 | 6 |
#include <lemon/concepts/graph.h> |
alpar@2260 | 7 |
#include <lemon/concepts/ugraph.h> |
deba@1962 | 8 |
#include <lemon/smart_graph.h> |
deba@1962 | 9 |
|
deba@1962 | 10 |
#include <lemon/edge_set.h> |
deba@1962 | 11 |
|
deba@1962 | 12 |
#include "test_tools.h" |
deba@1962 | 13 |
#include "graph_test.h" |
deba@1962 | 14 |
#include "map_test.h" |
deba@1962 | 15 |
|
deba@1962 | 16 |
|
deba@1962 | 17 |
using namespace lemon; |
alpar@2260 | 18 |
using namespace lemon::concepts; |
deba@1962 | 19 |
|
deba@2111 | 20 |
typedef SmartGraph RGraph; |
deba@1962 | 21 |
|
deba@1962 | 22 |
int main() { |
deba@1962 | 23 |
{ // checking edge_sets |
deba@2111 | 24 |
checkConcept<Graph, ListEdgeSet<RGraph> >(); |
deba@2111 | 25 |
checkConcept<UGraph, ListUEdgeSet<RGraph> >(); |
deba@2111 | 26 |
checkConcept<Graph, SmartEdgeSet<RGraph> >(); |
deba@2111 | 27 |
checkConcept<UGraph, SmartUEdgeSet<RGraph> >(); |
deba@1962 | 28 |
} |
deba@1962 | 29 |
|
deba@1962 | 30 |
std::cout << __FILE__ ": All tests passed.\n"; |
deba@1962 | 31 |
|
deba@1962 | 32 |
return 0; |
deba@1962 | 33 |
} |