MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Difference of Two Sets

What is the b...

Question

What is the best data structure to implement topological sort on directed graph?

A

Stack

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

B

Array

No worries! We‘ve got your back. Try BYJU‘S free classes today!

C

Heap

No worries! We‘ve got your back. Try BYJU‘S free classes today!

D

Queue

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is A Stack
The best data structure used to implement topological sort is stack, since topological sort based on depth first traversal.

Suggest Corrections

thumbs-up

0

Similar questions

Q. To implement Dijkstra's shortest path algorithm on unweighted graphs so that it runs in linear time, then data structure to be used is

Q. Graphs work best when data presentation :

Q. Let G (V, E) an undirected graph with positive edge weights. Dijkstra's single source-shortest path algorithm can be implemented using the binary heap data structure with time complexity?

Q. After collection of data, we should check for sorting of the collected data before representing it on graphs.

Q. Which of the following data structure is efficient to implement priority queue with basic operation such as insertion, deletion and searching ?

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Set Operations

MATHEMATICS

Watch in App

explore_more_icon

Explore more

Difference of Two Sets

Standard VII Mathematics

Join BYJU'S Learning Program

CrossIcon