Practice
Learn
← Quit
0 / 0 correct
Algorithms
Medium
1 of 10
Topological sort of a directed graph is possible exactly when the graph is what?
A
Acyclic (a DAG)
B
Weighted
C
Connected
D
A tree