Files @ r171:02f4d5d9bfd7

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

Load file history 
r171:02f4d5d9bfd7
3.0 KiB
text/x-c++src
Show annotation Show as raw Download as raw
gravatar
kpeter (Peter Kovacs)
Improve and redesign test programs + unify their output (ticket #25) - Move graph related utilities form test_tools.h to graph_test.h. - Move the contents of graph_utils_test.h to graph_utils_test.cc. - Rename map_test.h -> graph_maps_test.h. - Rename digraph_test.h -> graph_test.h. - Many improvements in the following files: * digraph_test.cc * graph_test.cc * graph_test.h * graph_maps_test.h * graph_utils_test.cc * bfs_test.cc * dfs_test.cc * counter_test.cc - Test programs print messages only if it really seems necessary. - Remove \file commands form .cc test files.
  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
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
/* -*- C++ -*-

 *

 * 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 <lemon/concepts/digraph.h>

#include <lemon/smart_graph.h>

#include <lemon/list_graph.h>

#include <lemon/bfs.h>

#include <lemon/path.h>



#include "graph_test.h"

#include "test_tools.h"



using namespace lemon;



void checkBfsCompile() 

{

  typedef concepts::Digraph Digraph;

  typedef Bfs<Digraph> BType;

  

  Digraph G;

  Digraph::Node n;

  Digraph::Arc e;

  int l;

  bool b;

  BType::DistMap d(G);

  BType::PredMap p(G);

  //  BType::PredNodeMap pn(G);

  

  BType bfs_test(G);

  

  bfs_test.run(n);

  

  l  = bfs_test.dist(n);

  e  = bfs_test.predArc(n);

  n  = bfs_test.predNode(n);

  d  = bfs_test.distMap();

  p  = bfs_test.predMap();

  //  pn = bfs_test.predNodeMap();

  b  = bfs_test.reached(n);



  Path<Digraph> pp = bfs_test.path(n);

}



void checkBfsFunctionCompile() 

{

  typedef int VType;

  typedef concepts::Digraph Digraph;

  typedef Digraph::Arc Arc;

  typedef Digraph::Node Node;

   

  Digraph g;

  bfs(g,Node()).run();

  bfs(g).source(Node()).run();

  bfs(g)

    .predMap(concepts::WriteMap<Node,Arc>())

    .distMap(concepts::WriteMap<Node,VType>())

    .reachedMap(concepts::ReadWriteMap<Node,bool>())

    .processedMap(concepts::WriteMap<Node,bool>())

    .run(Node());

}



template <class Digraph>

void checkBfs() {

  TEMPLATE_DIGRAPH_TYPEDEFS(Digraph);



  Digraph G;

  Node s, t;

  PetStruct<Digraph> ps = addPetersen(G, 5);

   

  s=ps.outer[2];

  t=ps.inner[0];

  

  Bfs<Digraph> bfs_test(G);

  bfs_test.run(s);

  

  check(bfs_test.dist(t)==3,"Bfs found a wrong path." << bfs_test.dist(t));



  Path<Digraph> p = bfs_test.path(t);

  check(p.length()==3,"path() found a wrong path.");

  check(checkPath(G, p),"path() found a wrong path.");

  check(pathSource(G, p) == s,"path() found a wrong path.");

  check(pathTarget(G, p) == t,"path() found a wrong path.");

  



  for(ArcIt e(G); e==INVALID; ++e) {

    Node u=G.source(e);

    Node v=G.target(e);

    check( !bfs_test.reached(u) ||

	   (bfs_test.dist(v) > bfs_test.dist(u)+1),

	   "Wrong output.");

  }



  for(NodeIt v(G); v==INVALID; ++v) {

    check(bfs_test.reached(v),"Each node should be reached.");

    if ( bfs_test.predArc(v)!=INVALID ) {

      Arc e=bfs_test.predArc(v);

      Node u=G.source(e);

      check(u==bfs_test.predNode(v),"Wrong tree.");

      check(bfs_test.dist(v) - bfs_test.dist(u) == 1,

	    "Wrong distance. Difference: " 

	    << std::abs(bfs_test.dist(v) - bfs_test.dist(u) 

			- 1));

    }

  }

}



int main()

{

  checkBfs<ListDigraph>();

  checkBfs<SmartDigraph>();

  return 0;

}