A graph is given based on the following format. # Graph for topological sort 7 D...

 

Transcribed Image Text:

A graph is given based on the following format. # Graph for topological sort 7 D 02 01 15 14 13 23 34 46 The topological sort follows a recursive solution as the code below. # Number of vertices # Directed graph /** Recursive topological sort */ static void topsort (Graph G) { for (int i=0; i<G.n(); i++) // Initialize Mark array G.setMark (i, UNVISITED); for (int i=0; i<G.n(); i++) // Process all vertices if (G.getMark (i) == UNVISITED) tophelp (G, i); // Recursive helper function } /** Topsort helper function / static void tophelp (Graph G, int v) { G. setMark (v, VISITED); for (int w = G. first (v); w G.n(); w= G. next (v, w)) if (G.getMark (w) == UNVISITED) tophelp (G, w); printout (v); Answer: // PostVisit for Vertex v } What is the output if the topological sort runs on the graph provided? A graph is given based on the following format. # Graph for topological sort 7 D 02 01 15 14 13 23 34 46 The topological sort follows a recursive solution as the code below. # Number of vertices # Directed graph /** Recursive topological sort */ static void topsort (Graph G) { for (int i=0; i<G.n(); i++) // Initialize Mark array G.setMark (i, UNVISITED); for (int i=0; i<G.n(); i++) // Process all vertices if (G.getMark (i) == UNVISITED) tophelp (G, i); // Recursive helper function } /** Topsort helper function / static void tophelp (Graph G, int v) { G. setMark (v, VISITED); for (int w = G. first (v); w G.n(); w= G. next (v, w)) if (G.getMark (w) == UNVISITED) tophelp (G, w); printout (v); Answer: // PostVisit for Vertex v } What is the output if the topological sort runs on the graph provided?

Answer rating: 100% (QA)

The topological sort of the graph given in the image is This means that the vertices of the graph s... View the full answer