Skip to content
Snippets Groups Projects
Commit caf9f33b authored by Matt Wala's avatar Matt Wala
Browse files

Merge branch 'master' into barrier-insertion-with-finer-dependency-tracking

parents 2340148b 5ea071a3
No related branches found
No related tags found
No related merge requests found
......@@ -60,8 +60,14 @@ def test_compute_sccs():
return result + [node]
for scc in sccs:
result = visit(scc[0])
assert set(result) == set(scc), (set(result), set(scc))
scc = set(scc)
assert not scc & visited
# Check that starting from each element of the SCC results
# in the same set of reachable nodes.
for scc_root in scc:
visited.difference_update(scc)
result = visit(scc_root)
assert set(result) == scc, (set(result), scc)
for nnodes in range(10, 20):
for i in range(40):
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment