Files @ r244:c30731a37f91

Location: LEMON/LEMON-main/test/path_test.cc

Load file history 
r244:c30731a37f91
1.3 KiB
text/x-c++src
Show annotation Show as raw Download as raw
gravatar
kpeter (Peter Kovacs)
Many improvements in bfs.h, dfs.h and dijkstra.h - Add run() function to Bfs and run(s,t) function to DfsVisit. - Add debug checking to addSource() function of Dfs and DfsVisit. - Add a few missing named parameters (according to \todo notes). - Small fixes in the code (e.g. missing derivations). - Many doc improvements. - Remove \todo and \warning comments which are no longer valid. - Remove \author commands (see ticket #39). - Fixes in the the doc (e.g. wrong references). - Hide the doc of most of the private and protected members. - Use public typedefs instead of template parameters in public functions. - Use better parameter names for some functions. - Other small changes to make the doc more uniform.
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
/* -*- mode: C++; indent-tabs-mode: nil; -*-

 *

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

 *

 * Copyright (C) 2003-2008

 * 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 <string>

#include <iostream>



#include <lemon/concepts/path.h>

#include <lemon/concepts/digraph.h>



#include <lemon/path.h>

#include <lemon/list_graph.h>



#include "test_tools.h"



using namespace std;

using namespace lemon;



void check_concepts() {

  checkConcept<concepts::Path<ListDigraph>, concepts::Path<ListDigraph> >();

  checkConcept<concepts::Path<ListDigraph>, Path<ListDigraph> >();

  checkConcept<concepts::Path<ListDigraph>, SimplePath<ListDigraph> >();

  checkConcept<concepts::Path<ListDigraph>, StaticPath<ListDigraph> >();

  checkConcept<concepts::Path<ListDigraph>, ListPath<ListDigraph> >();

}



int main() {

  check_concepts();

  return 0;

}