Dijkstra法求最短路径.docVIP

Dijkstra算法求最短路径(C#版) 行如下图的路径,(V0是中心):经过该算法后转化为下图using System;using System.Collections;using System.Text; namespace Greedy{?? ??? class Marx??? {??????? private int[] distance;??????? ??????? private int row;??????? private ArrayList ways = new ArrayList(); ??????? public Marx(int n,params int[] d)??????? {??????????? this.row = n;??????????? distance = new int[row * row];??????????? for (int i = 0; i row * row; i++)??????????? {??????????????? this.distance[i] = d[i];????????????? ??????????? }??????????? for (int i = 0; i this.row; i++)? //有row个点，则从中心到各点的路有row-1条