| Last change
                  on this file since 2376:0ed45a6c74b1 was
                  2335:27aa03cd3121,
                  checked in by Balazs Dezso, 19 years ago | 
        
          | 
New path concept and path structures
 
TODO: BellmanFord::negativeCycle()
 | 
        | File size:
            1.2 KB | 
      
      
        
  | Rev | Line |  | 
|---|
| [906] | 1 | /* -*- C++ -*- | 
|---|
|  | 2 | * | 
|---|
| [1956] | 3 | * This file is a part of LEMON, a generic C++ optimization library | 
|---|
|  | 4 | * | 
|---|
|  | 5 | * Copyright (C) 2003-2006 | 
|---|
|  | 6 | * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport | 
|---|
| [1359] | 7 | * (Egervary Research Group on Combinatorial Optimization, EGRES). | 
|---|
| [906] | 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 |  | 
|---|
| [820] | 19 | #include <string> | 
|---|
|  | 20 | #include <iostream> | 
|---|
| [2247] | 21 |  | 
|---|
| [2260] | 22 | #include <lemon/concepts/path.h> | 
|---|
|  | 23 | #include <lemon/concepts/graph.h> | 
|---|
| [2247] | 24 |  | 
|---|
| [921] | 25 | #include <lemon/path.h> | 
|---|
|  | 26 | #include <lemon/list_graph.h> | 
|---|
| [820] | 27 |  | 
|---|
| [2247] | 28 | #include "test_tools.h" | 
|---|
|  | 29 |  | 
|---|
| [820] | 30 | using namespace std; | 
|---|
| [921] | 31 | using namespace lemon; | 
|---|
| [820] | 32 |  | 
|---|
| [2247] | 33 | void check_concepts() { | 
|---|
| [2335] | 34 | checkConcept<concepts::Path<ListGraph>, concepts::Path<ListGraph> >(); | 
|---|
| [2260] | 35 | checkConcept<concepts::Path<ListGraph>, Path<ListGraph> >(); | 
|---|
| [2335] | 36 | checkConcept<concepts::Path<ListGraph>, SimplePath<ListGraph> >(); | 
|---|
|  | 37 | checkConcept<concepts::Path<ListGraph>, StaticPath<ListGraph> >(); | 
|---|
|  | 38 | checkConcept<concepts::Path<ListGraph>, ListPath<ListGraph> >(); | 
|---|
| [820] | 39 | } | 
|---|
|  | 40 |  | 
|---|
| [2247] | 41 | int main() { | 
|---|
| [2335] | 42 | check_concepts(); | 
|---|
| [2247] | 43 | return 0; | 
|---|
| [820] | 44 | } | 
|---|
       
      
      Note: See 
TracBrowser
        for help on using the repository browser.