alpar@209: /* -*- mode: C++; indent-tabs-mode: nil; -*- alpar@96: * alpar@209: * This file is a part of LEMON, a generic C++ optimization library. alpar@96: * alpar@96: * Copyright (C) 2003-2008 alpar@96: * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport alpar@96: * (Egervary Research Group on Combinatorial Optimization, EGRES). alpar@96: * alpar@96: * Permission to use, modify and distribute this software is granted alpar@96: * provided that this copyright notice appears in all copies. For alpar@96: * precise terms see the accompanying LICENSE file. alpar@96: * alpar@96: * This software is provided "AS IS" with no warranty of any kind, alpar@96: * express or implied, and with no claim as to its suitability for any alpar@96: * purpose. alpar@96: * alpar@96: */ alpar@96: alpar@96: #include <string> alpar@96: #include <iostream> alpar@96: alpar@96: #include <lemon/concepts/path.h> alpar@96: #include <lemon/concepts/digraph.h> alpar@96: alpar@96: #include <lemon/path.h> alpar@96: #include <lemon/list_graph.h> alpar@96: alpar@96: #include "test_tools.h" alpar@96: alpar@96: using namespace std; alpar@96: using namespace lemon; alpar@96: alpar@96: void check_concepts() { alpar@96: checkConcept<concepts::Path<ListDigraph>, concepts::Path<ListDigraph> >(); alpar@96: checkConcept<concepts::Path<ListDigraph>, Path<ListDigraph> >(); alpar@96: checkConcept<concepts::Path<ListDigraph>, SimplePath<ListDigraph> >(); alpar@96: checkConcept<concepts::Path<ListDigraph>, StaticPath<ListDigraph> >(); alpar@96: checkConcept<concepts::Path<ListDigraph>, ListPath<ListDigraph> >(); alpar@96: } alpar@96: alpar@96: int main() { alpar@209: check_concepts(); alpar@96: return 0; alpar@96: }