Current implementation of Tarjan's SCC algorithm at GraphUtils can be simplified a little bit more. This algorithm is being used in the compiler to convert a directed inference graph to a directed acyclic inference graph.

The current implementation is looking for nodes in the supporting stack data structure which is unnecessary. This enhancement won't be noticed for small inference graphs but should be noticeable for bigger ones.