test/edge_set_test.cc
author deba
Fri, 14 Apr 2006 18:07:33 +0000
changeset 2051 08652c1763f6
parent 1962 c1c3a0fae8a1
child 2111 ea1fa1bc3f6d
permissions -rw-r--r--
MaxWeightedBipartiteMatching
MinCostMaxBipartiteMatching

Both algorithms are based on successive shortest
path algorithm with dijkstra shortest path
finding
     1 // -*- c++ -*-
     2 
     3 #include <iostream>
     4 #include <vector>
     5 
     6 #include <lemon/concept/graph.h>
     7 #include <lemon/concept/ugraph.h>
     8 #include <lemon/smart_graph.h>
     9 
    10 #include <lemon/edge_set.h>
    11 
    12 #include "test_tools.h"
    13 #include "graph_test.h"
    14 #include "map_test.h"
    15 
    16 
    17 using namespace lemon;
    18 using namespace lemon::concept;
    19 
    20 typedef SmartGraph Graph;
    21 
    22 int main() {
    23   { // checking edge_sets
    24     checkConcept<StaticGraph, ListEdgeSet<Graph> >();
    25     checkConcept<UGraph, ListUEdgeSet<Graph> >();
    26     checkConcept<StaticGraph, SmartEdgeSet<Graph> >();
    27     checkConcept<UGraph, SmartUEdgeSet<Graph> >();
    28   }
    29 
    30   std::cout << __FILE__ ": All tests passed.\n";
    31 
    32   return 0;
    33 }