... | ... |
@@ -558,7 +558,7 @@ |
558 | 558 |
///added with addSource() before using this function. |
559 | 559 |
void start(Node t) |
560 | 560 |
{ |
561 |
while ( !emptyQueue() && |
|
561 |
while ( !emptyQueue() && !(*_reached)[t] ) |
|
562 | 562 |
processNextArc(); |
563 | 563 |
} |
564 | 564 |
|
... | ... |
@@ -1512,7 +1512,7 @@ |
1512 | 1512 |
/// \pre init() must be called and a root node should be added |
1513 | 1513 |
/// with addSource() before using this function. |
1514 | 1514 |
void start(Node t) { |
1515 |
while ( !emptyQueue() && |
|
1515 |
while ( !emptyQueue() && !(*_reached)[t] ) |
|
1516 | 1516 |
processNextArc(); |
1517 | 1517 |
} |
1518 | 1518 |
... | ... |
@@ -50,7 +50,10 @@ |
50 | 50 |
"6 3 7\n" |
51 | 51 |
"@attributes\n" |
52 | 52 |
"source 0\n" |
53 |
"target 5\n" |
|
53 |
"target 5\n" |
|
54 |
"source1 6\n" |
|
55 |
"target1 3\n"; |
|
56 |
|
|
54 | 57 |
|
55 | 58 |
void checkDfsCompile() |
56 | 59 |
{ |
... | ... |
@@ -144,11 +147,14 @@ |
144 | 147 |
|
145 | 148 |
Digraph G; |
146 | 149 |
Node s, t; |
150 |
Node s1, t1; |
|
147 | 151 |
|
148 | 152 |
std::istringstream input(test_lgf); |
149 | 153 |
digraphReader(G, input). |
150 | 154 |
node("source", s). |
151 | 155 |
node("target", t). |
156 |
node("source1", s1). |
|
157 |
node("target1", t1). |
|
152 | 158 |
run(); |
153 | 159 |
|
154 | 160 |
Dfs<Digraph> dfs_test(G); |
... | ... |
@@ -175,6 +181,11 @@ |
175 | 181 |
} |
176 | 182 |
|
177 | 183 |
{ |
184 |
Dfs<Digraph> dfs(G); |
|
185 |
check(dfs.run(s1,t1) && dfs.reached(t1),"Node 3 is reachable from Node 6."); |
|
186 |
} |
|
187 |
|
|
188 |
{ |
|
178 | 189 |
NullMap<Node,Arc> myPredMap; |
179 | 190 |
dfs(G).predMap(myPredMap).run(s); |
180 | 191 |
} |
0 comments (0 inline)