| Last change
                  on this file since 561:6e0525ec5355 was
                  440:88ed40ad0d4f,
                  checked in by Alpar Juttner <alpar@…>, 17 years ago | 
        
          | 
Happy New Year again
 update the copyright headers + run the source unifier
 | 
        | File size:
            1.3 KB | 
      
      
        
  | Line |  | 
|---|
| 1 | /* -*- mode: C++; indent-tabs-mode: nil; -*- | 
|---|
| 2 | * | 
|---|
| 3 | * This file is a part of LEMON, a generic C++ optimization library. | 
|---|
| 4 | * | 
|---|
| 5 | * Copyright (C) 2003-2009 | 
|---|
| 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 <string> | 
|---|
| 20 | #include <iostream> | 
|---|
| 21 |  | 
|---|
| 22 | #include <lemon/concepts/path.h> | 
|---|
| 23 | #include <lemon/concepts/digraph.h> | 
|---|
| 24 |  | 
|---|
| 25 | #include <lemon/path.h> | 
|---|
| 26 | #include <lemon/list_graph.h> | 
|---|
| 27 |  | 
|---|
| 28 | #include "test_tools.h" | 
|---|
| 29 |  | 
|---|
| 30 | using namespace std; | 
|---|
| 31 | using namespace lemon; | 
|---|
| 32 |  | 
|---|
| 33 | void check_concepts() { | 
|---|
| 34 | checkConcept<concepts::Path<ListDigraph>, concepts::Path<ListDigraph> >(); | 
|---|
| 35 | checkConcept<concepts::Path<ListDigraph>, Path<ListDigraph> >(); | 
|---|
| 36 | checkConcept<concepts::Path<ListDigraph>, SimplePath<ListDigraph> >(); | 
|---|
| 37 | checkConcept<concepts::Path<ListDigraph>, StaticPath<ListDigraph> >(); | 
|---|
| 38 | checkConcept<concepts::Path<ListDigraph>, ListPath<ListDigraph> >(); | 
|---|
| 39 | } | 
|---|
| 40 |  | 
|---|
| 41 | int main() { | 
|---|
| 42 | check_concepts(); | 
|---|
| 43 | return 0; | 
|---|
| 44 | } | 
|---|
       
      
      Note: See 
TracBrowser
        for help on using the repository browser.