| author | deba | 
| Fri, 11 May 2007 16:02:53 +0000 | |
| changeset 2443 | 14abfa02bf42 | 
| parent 2260 | 4274224f8a7d | 
| child 2553 | bfced05fa852 | 
| permissions | -rw-r--r-- | 
| alpar@2391 | 1  | 
/* -*- C++ -*-  | 
| alpar@2391 | 2  | 
*  | 
| alpar@2391 | 3  | 
* This file is a part of LEMON, a generic C++ optimization library  | 
| alpar@2391 | 4  | 
*  | 
| alpar@2391 | 5  | 
* Copyright (C) 2003-2007  | 
| alpar@2391 | 6  | 
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport  | 
| alpar@2391 | 7  | 
* (Egervary Research Group on Combinatorial Optimization, EGRES).  | 
| alpar@2391 | 8  | 
*  | 
| alpar@2391 | 9  | 
* Permission to use, modify and distribute this software is granted  | 
| alpar@2391 | 10  | 
* provided that this copyright notice appears in all copies. For  | 
| alpar@2391 | 11  | 
* precise terms see the accompanying LICENSE file.  | 
| alpar@2391 | 12  | 
*  | 
| alpar@2391 | 13  | 
* This software is provided "AS IS" with no warranty of any kind,  | 
| alpar@2391 | 14  | 
* express or implied, and with no claim as to its suitability for any  | 
| alpar@2391 | 15  | 
* purpose.  | 
| alpar@2391 | 16  | 
*  | 
| alpar@2391 | 17  | 
*/  | 
| deba@1962 | 18  | 
|
| deba@1962 | 19  | 
#include <iostream>  | 
| deba@1962 | 20  | 
#include <vector>  | 
| deba@1962 | 21  | 
|
| alpar@2260 | 22  | 
#include <lemon/concepts/graph.h>  | 
| alpar@2260 | 23  | 
#include <lemon/concepts/ugraph.h>  | 
| deba@1962 | 24  | 
#include <lemon/smart_graph.h>  | 
| deba@1962 | 25  | 
|
| deba@1962 | 26  | 
#include <lemon/edge_set.h>  | 
| deba@1962 | 27  | 
|
| deba@1962 | 28  | 
#include "test_tools.h"  | 
| deba@1962 | 29  | 
#include "graph_test.h"  | 
| deba@1962 | 30  | 
#include "map_test.h"  | 
| deba@1962 | 31  | 
|
| deba@1962 | 32  | 
|
| deba@1962 | 33  | 
using namespace lemon;  | 
| alpar@2260 | 34  | 
using namespace lemon::concepts;  | 
| deba@1962 | 35  | 
|
| deba@2111 | 36  | 
typedef SmartGraph RGraph;  | 
| deba@1962 | 37  | 
|
| deba@1962 | 38  | 
int main() {
 | 
| deba@1962 | 39  | 
  { // checking edge_sets
 | 
| deba@2111 | 40  | 
checkConcept<Graph, ListEdgeSet<RGraph> >();  | 
| deba@2111 | 41  | 
checkConcept<UGraph, ListUEdgeSet<RGraph> >();  | 
| deba@2111 | 42  | 
checkConcept<Graph, SmartEdgeSet<RGraph> >();  | 
| deba@2111 | 43  | 
checkConcept<UGraph, SmartUEdgeSet<RGraph> >();  | 
| deba@1962 | 44  | 
}  | 
| deba@1962 | 45  | 
|
| deba@1962 | 46  | 
std::cout << __FILE__ ": All tests passed.\n";  | 
| deba@1962 | 47  | 
|
| deba@1962 | 48  | 
return 0;  | 
| deba@1962 | 49  | 
}  |