Copyright header added.
2 * src/test/bfs_test.cc - Part of HUGOlib, a generic C++ optimization library
4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
5 * (Egervary Combinatorial Optimization Research Group, EGRES).
7 * Permission to use, modify and distribute this software is granted
8 * provided that this copyright notice appears in all copies. For
9 * precise terms see the accompanying LICENSE file.
11 * This software is provided "AS IS" with no warranty of any kind,
12 * express or implied, and with no claim as to its suitability for any
17 #include "test_tools.h"
18 #include <hugo/smart_graph.h>
20 #include<hugo/skeletons/graph.h>
24 const int PET_SIZE =5;
27 void check_Bfs_Compile()
29 typedef skeleton::StaticGraph Graph;
31 typedef Graph::Edge Edge;
32 typedef Graph::Node Node;
33 typedef Graph::EdgeIt EdgeIt;
34 typedef Graph::NodeIt NodeIt;
36 typedef Bfs<Graph> BType;
45 BType::PredNodeMap pn(G);
53 n = bfs_test.predNode(n);
54 d = bfs_test.distMap();
55 p = bfs_test.predMap();
56 pn = bfs_test.predNodeMap();
57 b = bfs_test.reached(n);
64 typedef SmartGraph Graph;
66 typedef Graph::Edge Edge;
67 typedef Graph::Node Node;
68 typedef Graph::EdgeIt EdgeIt;
69 typedef Graph::NodeIt NodeIt;
70 typedef Graph::EdgeMap<int> LengthMap;
74 PetStruct<Graph> ps = addPetersen(G,PET_SIZE);
79 Bfs<Graph> bfs_test(G);
82 check(bfs_test.dist(t)==3,"Bfs found a wrong path. " << bfs_test.dist(t));
85 for(EdgeIt e(G); e==INVALID; ++e) {
88 check( !bfs_test.reached(u) ||
89 (bfs_test.dist(v) > bfs_test.dist(u)+1),
93 for(NodeIt v(G); v==INVALID; ++v) {
94 check(bfs_test.reached(v),"Each node should be reached.");
95 if ( bfs_test.pred(v)!=INVALID ) {
96 Edge e=bfs_test.pred(v);
98 check(u==bfs_test.predNode(v),"Wrong tree.");
99 check(bfs_test.dist(v) - bfs_test.dist(u) == 1,
100 "Wrong distance. Difference: "
101 << std::abs(bfs_test.dist(v) - bfs_test.dist(u)