For Java:

Goals: Work with graph data structures and worklists.

Implement the in-degree based version of the Topological Sort algorithm.

Take as input a list of vertices and a list of edges for a directed graph.

Create the adjacency list representation, storing the outlist and the indegree for each vertex. (Count the vertices as you do so.) Set the label for the next vertex to 0.

Traverse the vertex headers in the adjacency list, placing any vertex with indegree 0 on a worklist (use a queue).

While the worklist is not empty: remove the top vertex, give it the current label, and increment the next_label. Traverse its adjacency list, decrementing the indegree of each of its out-neighbors. If an indegree becomes zero, add that vertex to the worklist.

If next_label == the number of vertices, report the topological labeling in numerical order. If not, report that there is a cycle