java普利姆算法(Prim)最小生成树修路问题代码实现
import java.util.Arrays;/** * @author Drug * @create 2020-05-15 16:42 */public class Prim { public static void main(String[] args) { //测试看看图是否创建ok char[] data = new char[]{'A','B','C','D','E','F','G'}; int verxs = data.len
