文档介绍：Dijkstra算法求最短路径(C#版)
[日期:2009-06-25]
来源:  作者:
[字体:大 中 小]
行如下图的路径,(V0是中心):
经过该算法后转化为下图
using System;
using ;
using ;
namespace Greedy
{   
    class Marx
    {
        private int[] distance;        
        private int row;
        private ArrayList ways = new ArrayList();
        public Marx(int n,params int[] d)
        {
            = n;
            distance = new int[row * row];
            for (int i = 0; i < row * row; i++)
            {
                [i] = d[i];              
            }
            for (int i = 0; i < ; i++)  //有row个点,则从中心到各点的路有row-1条
            {
                ArrayList w = new ArrayList();
                int j = 0;
                (j);
                (w);
            }
        }
        //------------------------------
        public void Find_way()
        {
            ArrayList S = new ArrayList(1);
            ArrayList Sr = new ArrayList(1);
            int []Indexof_distance=new int[];
            
            for(int i=0; i < row; i++)
            { 
                Indexof_distanc