使用欧氏距离实现 Prim 算法

Question

Let me straight forward put what i need. I have an array(first representing node and second representing some value): [[1,10],[2,8],[3,9]] . I made another array of euclidean distance between the nodes as follows:

[[0,2,1],[2,0,1],[1,1,0]]

Now I need to implement prim's algorithm for the nodes using the euclidean matrix as the weight of edges. Please help me.

Answer 1

If you haven't written any line of code yet, you might as well be considering what a Google search would yield for "python prim algorithm":

• Shortest Path Problems has a tutorial on Prim's Spanning Tree Algorithm
• Another implementation of Prim's Spanning Tree Algorithm very well commented
• prim.py : Prim's algorithm in Python
• Discussion and Python code
• Another python source
• Yet another python source