COIN-OR::LEMON - Graph Library

source: lemon-0.x/test/bfs_test.cc @ 2196:09af6d2b683b

Last change on this file since 2196:09af6d2b683b was 2135:15355b98fb84, checked in by Alpar Juttner, 14 years ago

Must have been changed because of the private copy constructor.

File size: 3.1 KB
RevLine 
[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
[774]19#include "test_tools.h"
[921]20#include <lemon/smart_graph.h>
21#include <lemon/bfs.h>
[1283]22#include <lemon/path.h>
[959]23#include<lemon/concept/graph.h>
[774]24
[921]25using namespace lemon;
[774]26
27const int PET_SIZE =5;
28
29
[793]30void check_Bfs_Compile()
[774]31{
[2111]32  typedef concept::Graph Graph;
[774]33
34  typedef Graph::Edge Edge;
35  typedef Graph::Node Node;
36  typedef Graph::EdgeIt EdgeIt;
37  typedef Graph::NodeIt NodeIt;
38 
39  typedef Bfs<Graph> BType;
40 
41  Graph G;
42  Node n;
43  Edge e;
[793]44  int l;
[774]45  bool b;
46  BType::DistMap d(G);
47  BType::PredMap p(G);
[1218]48  //  BType::PredNodeMap pn(G);
[774]49 
50  BType bfs_test(G);
51 
52  bfs_test.run(n);
53 
54  l  = bfs_test.dist(n);
[1763]55  e  = bfs_test.predEdge(n);
[774]56  n  = bfs_test.predNode(n);
57  d  = bfs_test.distMap();
58  p  = bfs_test.predMap();
[1218]59  //  pn = bfs_test.predNodeMap();
[774]60  b  = bfs_test.reached(n);
61
[1283]62  DirPath<Graph> pp(G);
63  bfs_test.getPath(pp,n);
[774]64}
65
[1220]66void check_Bfs_Function_Compile()
67{
68  typedef int VType;
[2111]69  typedef concept::Graph Graph;
[1220]70
71  typedef Graph::Edge Edge;
72  typedef Graph::Node Node;
73  typedef Graph::EdgeIt EdgeIt;
74  typedef Graph::NodeIt NodeIt;
75  typedef concept::ReadMap<Edge,VType> LengthMap;
76   
[2135]77  Graph g;
78  bfs(g,Node()).run();
79  bfs(g).source(Node()).run();
80  bfs(g)
[1220]81    .predMap(concept::WriteMap<Node,Edge>())
82    .distMap(concept::WriteMap<Node,VType>())
83    .reachedMap(concept::ReadWriteMap<Node,bool>())
84    .processedMap(concept::WriteMap<Node,bool>())
85    .run(Node());
86 
87}
88
[774]89int main()
90{
91   
92  typedef SmartGraph Graph;
93
94  typedef Graph::Edge Edge;
95  typedef Graph::Node Node;
96  typedef Graph::EdgeIt EdgeIt;
97  typedef Graph::NodeIt NodeIt;
98  typedef Graph::EdgeMap<int> LengthMap;
99
100  Graph G;
101  Node s, t;
102  PetStruct<Graph> ps = addPetersen(G,PET_SIZE);
103   
104  s=ps.outer[2];
105  t=ps.inner[0];
106 
107  Bfs<Graph> bfs_test(G);
108  bfs_test.run(s);
109 
110  check(bfs_test.dist(t)==3,"Bfs found a wrong path. " << bfs_test.dist(t));
111
[1283]112  DirPath<Graph> p(G);
113  check(bfs_test.getPath(p,t),"getPath() failed to set the path.");
114  check(p.length()==3,"getPath() found a wrong path.");
115 
[774]116
117  for(EdgeIt e(G); e==INVALID; ++e) {
[986]118    Node u=G.source(e);
119    Node v=G.target(e);
[774]120    check( !bfs_test.reached(u) ||
121           (bfs_test.dist(v) > bfs_test.dist(u)+1),
122           "Wrong output.");
123  }
124
[780]125  for(NodeIt v(G); v==INVALID; ++v) {
126    check(bfs_test.reached(v),"Each node should be reached.");
[1763]127    if ( bfs_test.predEdge(v)!=INVALID ) {
128      Edge e=bfs_test.predEdge(v);
[986]129      Node u=G.source(e);
[780]130      check(u==bfs_test.predNode(v),"Wrong tree.");
[774]131      check(bfs_test.dist(v) - bfs_test.dist(u) == 1,
[780]132            "Wrong distance. Difference: "
[774]133            << std::abs(bfs_test.dist(v) - bfs_test.dist(u)
134                        - 1));
135    }
[780]136  }
[774]137}
[780]138
Note: See TracBrowser for help on using the repository browser.