test/edge_set_test.cc
author deba
Mon, 07 May 2007 08:49:57 +0000
changeset 2439 3f1c7a6c33cd
parent 2260 4274224f8a7d
child 2553 bfced05fa852
permissions -rw-r--r--
Modified start() function in Dfs and Dijkstra classes to give back reached
edge/node.

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