Computer Science and Engineering › Graph › Question #5653
Single Choice Easy

QWhat is a topological sort?

ID: #5653 Graph 172 views
Question Info
#5653Q ID
EasyDifficulty
GraphTopic
Start Quiz on This Topic
 Your Answer

Choose the Best Option

Click any option to instantly check if you're correct.

  • A A way to sort the vertices of a graph based on their degrees ✔ ✖
  • B A way to sort the vertices of a graph based on their distances from a particular node ✔ ✖
  • C A way to sort the vertices of a directed acyclic graph based on their dependencies ✔ ✖
  • D A way to sort the edges of a graph based on their weights ✔ ✖
Correct Answer

Explanation

A way to sort the vertices of a directed acyclic graph based on their dependencies.

Note: A topological sort is only possible for a directed acyclic graph (DAG) as there should not be any cycles in it. It provides a linear ordering of the vertices such that for every directed edge uv from vertex u to vertex v, u comes before v in the ordering.

 Continue Practice
Previous Question Next Question
 Share

Share This Question

Challenge a friend or share with your study group.

 More from This Topic

Related MCQ Questions

What is the difference between a directed and an undirected graph?... What is a bipartite graph?... What is the time complexity of Breadth First Search (BFS) on a graph with V vertices and E edges?... What is a graph?... What is the Kruskal's algorithm used for in graph theory?... What is Dijkstra's algorithm used for in graph theory?... What is a path in a graph?... What is a weighted graph?... What is an undirected graph?... What is a vertex in a graph?...