1 votes 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 Algorithms topological-sort + – 2018 asked Nov 23, 2016 • edited Nov 23, 2016 by Prashant. 2018 447 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Prashant. commented Nov 23, 2016 reply Follow Share Actualy WE can use DFS or BFS for topologcal sort 1 votes 1 votes Habibkhan commented Nov 23, 2016 reply Follow Share Yes it can be done..Plz have a look in the link : https://www.quora.com/Can-topological-sorting-be-done-using-BFS# 1 votes 1 votes Habibkhan commented Nov 23, 2016 reply Follow Share Have a look at my comment @Anirudh.. 1 votes 1 votes Prashant. commented Nov 23, 2016 reply Follow Share Ya it can be used . thanx 1 votes 1 votes Please log in or register to add a comment.
