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