(dsk, order)
| 2064 | |
| 2065 | |
| 2066 | def assert_topological_sort(dsk, order): |
| 2067 | dependencies, dependents = get_deps(dsk) |
| 2068 | num_needed = {k: len(dependencies[k]) for k in dsk} |
| 2069 | for k in sorted(dsk, key=order.__getitem__): |
| 2070 | assert num_needed[k] == 0 |
| 2071 | for dep in dependents[k]: |
| 2072 | num_needed[dep] -= 1 |
| 2073 | |
| 2074 | |
| 2075 | def test_doublediff(abcde): |
no test coverage detected
searching dependent graphs…