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