c | e b | | d a Prefer longer chains first so we should start with d
(abcde)
| 447 | |
| 448 | |
| 449 | def test_prefer_deep(abcde): |
| 450 | """ |
| 451 | c |
| 452 | | |
| 453 | e b |
| 454 | | | |
| 455 | d a |
| 456 | |
| 457 | Prefer longer chains first so we should start with d |
| 458 | """ |
| 459 | a, b, c, d, e = abcde |
| 460 | dsk = {a: 1, b: (f, a), c: (f, b), d: 1, e: (f, d)} |
| 461 | |
| 462 | o = order(dsk) |
| 463 | assert_topological_sort(dsk, o) |
| 464 | assert o[a] < o[d] |
| 465 | assert o[b] < o[d] |
| 466 | |
| 467 | |
| 468 | def test_stacklimit(abcde): |
nothing calls this directly
no test coverage detected
searching dependent graphs…