一个简单的Dijkstra算法的实现,用一个数组来表示邻接矩阵-a simple realization of the Dijkstra algorithm, using an array said adjacency matrix

adjacency matrix. This an NV by NV matrix A in which A(I,J) is the number of edges between nodes I and J. Ordinarily, this value is either 0 or 1, although there are natural extensions to this idea.-returns the adjacency matrix of a graph.