Directed Cyclic Graph is where sorting significantly deals with ordering of Vertices - Data Structure

Q.  The concept of topological sorting significantly deals with an ordering of Vertices in  _________.
- Published on 27 Aug 15

a. A Directed Cyclic Graph
b. An Undirected Cyclic Graph
c. A Directed Linear Graph
d. An Undirected Linear Graph

ANSWER: A Directed Cyclic Graph
 

    Discussion

  • Nirja Shah   -Posted on 18 Nov 15
    Topological sorting deals with a Directed Cyclic Graph. It is the linear ordering of all the vertices such that if there is a path from vertex x to y, then x comes before y in that order. The sequence of vertices of graph in the linear ordering is known as topological order. For topological sorting, there should not be cycle in the graph.

Post your comment / Share knowledge


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)