alpar@2391: /* -*- C++ -*-
alpar@2391:  *
alpar@2391:  * This file is a part of LEMON, a generic C++ optimization library
alpar@2391:  *
alpar@2553:  * Copyright (C) 2003-2008
alpar@2391:  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
alpar@2391:  * (Egervary Research Group on Combinatorial Optimization, EGRES).
alpar@2391:  *
alpar@2391:  * Permission to use, modify and distribute this software is granted
alpar@2391:  * provided that this copyright notice appears in all copies. For
alpar@2391:  * precise terms see the accompanying LICENSE file.
alpar@2391:  *
alpar@2391:  * This software is provided "AS IS" with no warranty of any kind,
alpar@2391:  * express or implied, and with no claim as to its suitability for any
alpar@2391:  * purpose.
alpar@2391:  *
alpar@2391:  */
deba@1962: 
deba@1962: #include <iostream>
deba@1962: #include <vector>
deba@1962: 
alpar@2260: #include <lemon/concepts/graph.h>
alpar@2260: #include <lemon/concepts/ugraph.h>
deba@1962: #include <lemon/smart_graph.h>
deba@1962: 
deba@1962: #include <lemon/edge_set.h>
deba@1962: 
deba@1962: #include "test_tools.h"
deba@1962: #include "graph_test.h"
deba@1962: #include "map_test.h"
deba@1962: 
deba@1962: 
deba@1962: using namespace lemon;
alpar@2260: using namespace lemon::concepts;
deba@1962: 
deba@2111: typedef SmartGraph RGraph;
deba@1962: 
deba@1962: int main() {
deba@1962:   { // checking edge_sets
deba@2111:     checkConcept<Graph, ListEdgeSet<RGraph> >();
deba@2111:     checkConcept<UGraph, ListUEdgeSet<RGraph> >();
deba@2111:     checkConcept<Graph, SmartEdgeSet<RGraph> >();
deba@2111:     checkConcept<UGraph, SmartUEdgeSet<RGraph> >();
deba@1962:   }
deba@1962: 
deba@1962:   std::cout << __FILE__ ": All tests passed.\n";
deba@1962: 
deba@1962:   return 0;
deba@1962: }