... | ... |
@@ -567,3 +567,3 @@ |
567 | 567 |
{ |
568 |
while ( !emptyQueue() && |
|
568 |
while ( !emptyQueue() && !(*_reached)[t] ) |
|
569 | 569 |
processNextArc(); |
... | ... |
@@ -1514,3 +1514,3 @@ |
1514 | 1514 |
void start(Node t) { |
1515 |
while ( !emptyQueue() && |
|
1515 |
while ( !emptyQueue() && !(*_reached)[t] ) |
|
1516 | 1516 |
processNextArc(); |
... | ... |
@@ -52,3 +52,6 @@ |
52 | 52 |
"source 0\n" |
53 |
"target 5\n" |
|
53 |
"target 5\n" |
|
54 |
"source1 6\n" |
|
55 |
"target1 3\n"; |
|
56 |
|
|
54 | 57 |
|
... | ... |
@@ -181,2 +184,3 @@ |
181 | 184 |
Node s, t; |
185 |
Node s1, t1; |
|
182 | 186 |
|
... | ... |
@@ -186,2 +190,4 @@ |
186 | 190 |
node("target", t). |
191 |
node("source1", s1). |
|
192 |
node("target1", t1). |
|
187 | 193 |
run(); |
... | ... |
@@ -212,2 +218,7 @@ |
212 | 218 |
{ |
219 |
Dfs<Digraph> dfs(G); |
|
220 |
check(dfs.run(s1,t1) && dfs.reached(t1),"Node 3 is reachable from Node 6."); |
|
221 |
} |
|
222 |
|
|
223 |
{ |
|
213 | 224 |
NullMap<Node,Arc> myPredMap; |
0 comments (0 inline)