The graph adadptors can be alteration observed.
In most cases it uses the adapted graph alteration notifiers.
Only special case is now the UndirGraphAdaptor, where
we have to proxy the signals from the graph.
The SubBidirGraphAdaptor is removed, because it doest not
gives more feature than the EdgeSubGraphAdaptor<UndirGraphAdaptor<Graph>>.
The ResGraphAdaptor is based on this composition.
3 * This file is a part of LEMON, a generic C++ optimization library
5 * Copyright (C) 2003-2006
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7 * (Egervary Research Group on Combinatorial Optimization, EGRES).
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.
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
19 #include "test_tools.h"
20 #include <lemon/smart_graph.h>
21 #include <lemon/bfs.h>
22 #include <lemon/path.h>
23 #include<lemon/concept/graph.h>
25 using namespace lemon;
27 const int PET_SIZE =5;
30 void check_Bfs_Compile()
32 typedef concept::StaticGraph Graph;
34 typedef Graph::Edge Edge;
35 typedef Graph::Node Node;
36 typedef Graph::EdgeIt EdgeIt;
37 typedef Graph::NodeIt NodeIt;
39 typedef Bfs<Graph> BType;
48 // BType::PredNodeMap pn(G);
55 e = bfs_test.predEdge(n);
56 n = bfs_test.predNode(n);
57 d = bfs_test.distMap();
58 p = bfs_test.predMap();
59 // pn = bfs_test.predNodeMap();
60 b = bfs_test.reached(n);
63 bfs_test.getPath(pp,n);
66 void check_Bfs_Function_Compile()
69 typedef concept::StaticGraph Graph;
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;
77 bfs(Graph(),Node()).run();
78 bfs(Graph()).source(Node()).run();
80 .predMap(concept::WriteMap<Node,Edge>())
81 .distMap(concept::WriteMap<Node,VType>())
82 .reachedMap(concept::ReadWriteMap<Node,bool>())
83 .processedMap(concept::WriteMap<Node,bool>())
91 typedef SmartGraph Graph;
93 typedef Graph::Edge Edge;
94 typedef Graph::Node Node;
95 typedef Graph::EdgeIt EdgeIt;
96 typedef Graph::NodeIt NodeIt;
97 typedef Graph::EdgeMap<int> LengthMap;
101 PetStruct<Graph> ps = addPetersen(G,PET_SIZE);
106 Bfs<Graph> bfs_test(G);
109 check(bfs_test.dist(t)==3,"Bfs found a wrong path. " << bfs_test.dist(t));
112 check(bfs_test.getPath(p,t),"getPath() failed to set the path.");
113 check(p.length()==3,"getPath() found a wrong path.");
116 for(EdgeIt e(G); e==INVALID; ++e) {
119 check( !bfs_test.reached(u) ||
120 (bfs_test.dist(v) > bfs_test.dist(u)+1),
124 for(NodeIt v(G); v==INVALID; ++v) {
125 check(bfs_test.reached(v),"Each node should be reached.");
126 if ( bfs_test.predEdge(v)!=INVALID ) {
127 Edge e=bfs_test.predEdge(v);
129 check(u==bfs_test.predNode(v),"Wrong tree.");
130 check(bfs_test.dist(v) - bfs_test.dist(u) == 1,
131 "Wrong distance. Difference: "
132 << std::abs(bfs_test.dist(v) - bfs_test.dist(u)