There is complete undirected graph, in which about 10000 vertices. Is there more better way to find a minimum spanning tree, than Kruskal's algorithm, Prim's algorithm or Borůvka's algorithm?
Asked
Active
Viewed 36 times
0
-
Prim with a custom, density-exploiting priority queue is O(n^2)-time, but every time I've seen a question like this in the past, it's been the case that the edge weights are Euclidean distances or something. Is that so for you as well? – David Eisenstat Mar 02 '15 at 18:35
-
@DavidEisenstat, yeah, this is a my case too. I use Euclidean distances. – Max Mar 02 '15 at 18:42
-
How many dimensions? – David Eisenstat Mar 02 '15 at 18:51
-
@DavidEisenstat, there is 2 dimensions. – Max Mar 02 '15 at 18:57