previous | start | next

Data Structures after first step; start of second step

First vertex F is output. All vertices on its adjacency list have their in-degrees decremented in the degreeOf HashMap. None become 0, so nothing is added to the LinkedList zeroDegree.



previous | start | next