/* -*- C++ -*-

 *

 * This file is a part of LEMON, a generic C++ optimization library

 *

 * Copyright (C) 2003-2006

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Research Group on Combinatorial Optimization, EGRES).

 *

 * Permission to use, modify and distribute this software is granted

 * provided that this copyright notice appears in all copies. For

 * precise terms see the accompanying LICENSE file.

 *

 * This software is provided "AS IS" with no warranty of any kind,

 * express or implied, and with no claim as to its suitability for any

 * purpose.

 *

 */

#include <iostream>

#include <vector>

#include <lemon/concept/graph.h>

#include <lemon/list_graph.h>

#include <lemon/smart_graph.h>

#include <lemon/full_graph.h>

#include <lemon/hypercube_graph.h>

#include "test_tools.h"

#include "graph_test.h"

#include "map_test.h"

using namespace lemon;

using namespace lemon::concept;

int main() {

  { // checking graph components

    checkConcept<BaseGraphComponent, BaseGraphComponent >();

    checkConcept<BaseIterableGraphComponent<>, 

      BaseIterableGraphComponent<> >();

    checkConcept<IDableGraphComponent<>, 

      IDableGraphComponent<> >();

    checkConcept<IterableGraphComponent<>, 

      IterableGraphComponent<> >();

    checkConcept<MappableGraphComponent<>, 

      MappableGraphComponent<> >();

  }

  { // checking skeleton graphs

    checkConcept<Graph, Graph>();

  }

  { // checking list graph

    checkConcept<Graph, ListGraph >();

    checkConcept<AlterableGraphComponent<>, ListGraph>();

    checkConcept<ExtendableGraphComponent<>, ListGraph>();

    checkConcept<ClearableGraphComponent<>, ListGraph>();

    checkConcept<ErasableGraphComponent<>, ListGraph>();

    checkGraph<ListGraph>();

    checkGraphNodeMap<ListGraph>();

    checkGraphEdgeMap<ListGraph>();

  }

  { // checking smart graph

    checkConcept<Graph, SmartGraph >();

    checkGraph<SmartGraph>();

    checkGraphNodeMap<SmartGraph>();

    checkGraphEdgeMap<SmartGraph>();

  }

  { // checking full graph

    checkConcept<Graph, FullGraph >();

  }

  { // checking full graph

    checkConcept<Graph, HyperCubeGraph >();

  }

  std::cout << __FILE__ ": All tests passed.\n";

  return 0;

}