Skip to content
Ravnary
A Knowledge Platform
Categories
Learn
Cheatsheets
Paths
Favourites
Review
Community
Colour theme
Light
Dark
System
Learn
Coding Interview Patterns
Tree and Graph Patterns
Graph Modelling
Quiz
Q 01
/ 04
Intermediate
Question 1 of 4. 0 correct, 0 incorrect.
Each build task lists the tasks it needs done first. What tells whether every task can be built, and in what order?
Breadth-first search from any task
A topological sort, which fails exactly when the dependencies form a cycle
Dijkstra's algorithm
Check answer
Home
Learn
Paths
Saved
Community