| ... | ... |
@@ -37,25 +37,25 @@ |
| 37 | 37 |
int length() const {
|
| 38 | 38 |
int len = 0; |
| 39 | 39 |
typename Digraph::Node node = target; |
| 40 | 40 |
typename Digraph::Arc arc; |
| 41 | 41 |
while ((arc = predMap[node]) != INVALID) {
|
| 42 | 42 |
node = digraph.source(arc); |
| 43 | 43 |
++len; |
| 44 | 44 |
} |
| 45 | 45 |
return len; |
| 46 | 46 |
} |
| 47 | 47 |
|
| 48 | 48 |
bool empty() const {
|
| 49 |
return predMap[target] |
|
| 49 |
return predMap[target] == INVALID; |
|
| 50 | 50 |
} |
| 51 | 51 |
|
| 52 | 52 |
class RevArcIt {
|
| 53 | 53 |
public: |
| 54 | 54 |
RevArcIt() {}
|
| 55 | 55 |
RevArcIt(Invalid) : path(0), current(INVALID) {}
|
| 56 | 56 |
RevArcIt(const PredMapPath& _path) |
| 57 | 57 |
: path(&_path), current(_path.target) {
|
| 58 | 58 |
if (path->predMap[current] == INVALID) current = INVALID; |
| 59 | 59 |
} |
| 60 | 60 |
|
| 61 | 61 |
operator const typename Digraph::Arc() const {
|
0 comments (0 inline)