Search the courses, subjects, tracks, games and features, or jump straight to a page.
3 cards from this section. Quick, good the night before a test.
Define a Directed Acyclic Graph (DAG).
Think about what 'acyclic' means.
What does indegree represent in a graph?
Consider the direction of the edges.
What does DAG stand for?
The acronym includes 'Acyclic'.
True or False: Every directed graph must have at least one vertex with indegree greater than 0.
Think about independent vertices.
Given a DAG representing tasks: Task A must be completed before Task B, and Task B must be completed before Task C. Can you suggest a topological ordering of these tasks?
List the tasks starting from no dependencies.
Consider a more complex DAG with tasks A through E with the dependencies A -> B, A -> C, B -> D, and C -> D and D -> E. What is one valid topological order?
Follow the dependency chains while sorting.
5 more questions in this section. Enroll free to practise them all.
Enroll free