461
views
0 answers
1 votes
Topological sort can be performed using one breadth-first search procedure on the graph??ans) False. why? as both are DFS and BFS can do it in O(v+e) time