Skip to content

Resolve "port the dfvs verifier to rust, it seems to be broken"

Closes #31 (closed)

Works through all nodes with in_degree 0, and removes them + adds all of their neighbors that now have in_degree 0 to a queue, repeat. If graph is empty at the end then graph was acyclic.

Merge request reports