Concerns the prim's algorithm, using the min heap, very easy for a professional

Very simple project, it takes vertices from the user, and then data for there vertices, and then using the prim's algorithm and min heap it gives the total tree weight, array pi content, and array key content. I will give more detail if you can you can complete this within 12-14 hours.

算法 C++编程 工程

项目ID： #6825040

关于项目