This traverses the specified nodes in topological order to verify there are no cycles. Starting with inputless nodes, it visits nodes whose inputs have all been visited, and counts the total number of visited nodes. If there is a cycle, nodes in the cycle will never be visited, and the visited count will be less than the total node count.
source not stored for this graph (policy: none)
no test coverage detected