Which of the following algorithms is used to find the topological ordering of a directed acyclic graph? a) Depth-First Search (DFS) b) Breadth-First Search (BFS) c) Dijkstra's algorithm d) Kahn's algorithm
Which of the following algorithms is used to find the topological ordering of a directed acyclic graph? a) Depth-First Search (DFS) b) Breadth-First Search (BFS) c) Dijkstra's algorithm d) Kahn's algorithm
Share
Answer: d) Kahn’s algorithm