(node)
| 684 | ordered_nodes = [] |
| 685 | |
| 686 | def Visit(node): |
| 687 | if node in visiting: |
| 688 | raise CycleError(visiting) |
| 689 | if node in visited: |
| 690 | return |
| 691 | visited.add(node) |
| 692 | visiting.add(node) |
| 693 | for neighbor in get_edges(node): |
| 694 | Visit(neighbor) |
| 695 | visiting.remove(node) |
| 696 | ordered_nodes.insert(0, node) |
| 697 | |
| 698 | for node in sorted(graph): |
| 699 | Visit(node) |
no test coverage detected
searching dependent graphs…