Question

2. Apply the topological sort algorithm to the graph below. Follow the algorithm in you textbook and clearly show the content of the three lists: resultList, nolncoming and remainingEdges after each iteration GraphTopologicalSort (graph) { resultList = empty list of vertices no Incoming = list of all vertices with no incoming edges remainingEdges = list of all edges in the graph while (noIncoming is not empty) { currentV = remove any vertex from no Incoming Add currentV to resultList outgoingEdges = remove currentV's outgoing edges from remainingadges for each edge currents in outgoingEdges i inCount = GraphGetIncomingEdgeCount (remainingEdges, currentE-toVertex if (inCount == 0) Add currentE-toVertex to no Incoming } 3 return resultList

Apply the topological sort algorithm to the graph. Follow the algorithm in you textbook and clearly show the content of the three lists: resultList, noIncoming and remainingEdges after each iteration.

Answer 1

resultList	noIncoming	remainingEdges
[]	[6 0 ]	[1 2 3 4 5]
[6]	[0]	[1 2 3 4 5]
[6 0]	[1 ]	[2 3 4 5]
[6 0 1]	[2 5]	[3 4]
[6 0 1 2]	[5 ]	[3 4]
[6 0 1 2 5]	[3 4]	[]
[6 0 1 2 5 3]	[4]	[]
[6 0 1 2 5 3 4]	[]	[]

Topological Sorted Order is [6 0 1 2 5 3 4]

please up vote