Practice
Learn
← Quit
0 / 0 correct
Algorithms
Hard
1 of 20
Which MST algorithm is generally better for dense graphs?
A
Bellman-Ford
B
Kruskal's
C
Topological sort
D
Prim's with an adjacency matrix in O(V^2)