... | ... |
@@ -595,13 +595,15 @@ |
595 | 595 |
_curr_node = u; |
596 | 596 |
_curr_level = level[u].second; |
597 | 597 |
_curr_found = true; |
598 | 598 |
} |
599 | 599 |
} |
600 | 600 |
level[u] = Pair(i, j); |
601 |
|
|
601 |
if (j != 0) { |
|
602 |
u = _gr.source(_data[u][j].pred); |
|
603 |
} |
|
602 | 604 |
} |
603 | 605 |
} |
604 | 606 |
|
605 | 607 |
// If at least one cycle is found, check the optimality condition |
606 | 608 |
LargeValue d; |
607 | 609 |
if (_curr_found && k < n) { |
0 comments (0 inline)