FeiWuLiuZiao's blog

By FeiWuLiuZiao, history, 8 hours ago, In English

just curious

  • Vote: I like it
  • -2
  • Vote: I do not like it

»
8 hours ago, # |
  Vote: I like it +3 Vote: I do not like it

And is there a Euclidean Distance MST algo

»
15 minutes ago, # |
  Vote: I like it 0 Vote: I do not like it

What is a minimum spanning link? Is it a minimum spanning tree? If yes, then you can use any minimum spanning tree algorithm and just use the manhatten distances or the euclidean distances as the edge weights.