| ... | ... |
@@ -44,17 +44,17 @@ |
| 44 | 44 |
while ((arc = predMap[node]) != INVALID) {
|
| 45 | 45 |
node = digraph.source(arc); |
| 46 | 46 |
++len; |
| 47 | 47 |
} |
| 48 | 48 |
return len; |
| 49 | 49 |
} |
| 50 | 50 |
|
| 51 | 51 |
bool empty() const {
|
| 52 |
return predMap[target] |
|
| 52 |
return predMap[target] == INVALID; |
|
| 53 | 53 |
} |
| 54 | 54 |
|
| 55 | 55 |
class RevArcIt {
|
| 56 | 56 |
public: |
| 57 | 57 |
RevArcIt() {}
|
| 58 | 58 |
RevArcIt(Invalid) : path(0), current(INVALID) {}
|
| 59 | 59 |
RevArcIt(const PredMapPath& _path) |
| 60 | 60 |
: path(&_path), current(_path.target) {
|
| ... | ... |
@@ -118,17 +118,17 @@ |
| 118 | 118 |
while ((arc = predMatrixMap(source, node)) != INVALID) {
|
| 119 | 119 |
node = digraph.source(arc); |
| 120 | 120 |
++len; |
| 121 | 121 |
} |
| 122 | 122 |
return len; |
| 123 | 123 |
} |
| 124 | 124 |
|
| 125 | 125 |
bool empty() const {
|
| 126 |
return source |
|
| 126 |
return predMatrixMap(source, target) == INVALID; |
|
| 127 | 127 |
} |
| 128 | 128 |
|
| 129 | 129 |
class RevArcIt {
|
| 130 | 130 |
public: |
| 131 | 131 |
RevArcIt() {}
|
| 132 | 132 |
RevArcIt(Invalid) : path(0), current(INVALID) {}
|
| 133 | 133 |
RevArcIt(const PredMatrixMapPath& _path) |
| 134 | 134 |
: path(&_path), current(_path.target) {
|
0 comments (0 inline)