r795:921d5bf41ac2
Wed, 18 Nov 2009 21:21:26
[Not Reviewed]
0 comments (0 inline)
0
1
0
| ... | ... |
@@ -595,15 +595,17 @@ |
| 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 |
if (j != 0) {
|
|
| 601 | 602 |
u = _gr.source(_data[u][j].pred); |
| 602 | 603 |
} |
| 603 | 604 |
} |
| 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) {
|
| 608 | 610 |
// Find node potentials |
| 609 | 611 |
for (int i = 0; i < n; ++i) {
|
0 comments (0 inline)