Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by 2018
461
views
0
answers
1
votes
MIT QUIZs 2009
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
461
views
asked
Nov 23, 2016
Algorithms
topological-sort
+
–
Page:
« prev
1
2
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register