13. Graph Topoligical Sorting

a topological sort can be done on a cyclic graph.

Select the correct definition. Topological sorting:

What is Topological Sorting?

What is not part of algorithm for topological graph?

Any linear ordering of all of the vertices in which all the arrows go to the right is a valid solution. The statemen is an example of:

In the topological algorithm once you select a vertex V with an out outdegree of 0, where do you place the V in the list?

The algorithm for topological sorting includes

What is any linear ordering of all of the verticies of a graph in which all the arrows go to the right is a valid solution?

Any linear Ordering of all vertices where all the arrows point to the left is a valid solution

In order to perform a topilogical sort, the graph must be:

For any given directed acyclic graph, there could be ______ valid topological sorts.

In an example of topological orders, which of the following is correct?

Is topological sorting possible if and only if the graph has no directed cycles?

Is the example topological orders true or false? Any linear ordering of all of the vertices in which all the arrows go to the right is a valid solution.

Given this sudo-method: list digraph::topoSort() { // make a copy of digraph G // make a list l // for each vertex in G // select a vertex v with an outdegree of 2 // add v to the front of l // delete v and it's edges from the digraph } What is the problem with this method?