D[i][j] = G[i][j];
                    P[i][j] = i;
                    /*初始化*/
                }

            for (i = 0; i < n; i++)
            {
                D[i][i] = 0;
                P[i][i] = 0;
                /*另阻抗矩阵、倒数第二个节点矩阵的对角线为0 */
            }

            for (k = 1; k <= n; k++)
                for (i = 1; i <= n; i++)
                    for (j = 1; j <= n; j++)
                    {    /*利用三重循环将各种情况穷举*/
                        if (D[i][j] > D[i][k] + D[k][j])
                        /*加入中间顶点k来试探*/
                        {
                            D[i][j] = D[i][k] + D[k][j];
                            /*重新置两点间的最短路径*/
                            P[i][j] = P[k][j];
                            /*重新记录所通过的点*/

                        }
                        // Console.Write("{0},{1}",i,j);
                    }
            // Console.WriteLine();
        }

        public void AON()
        /*对出行流量进行全有全无分配，全有全无分配法（all or nothing method）是将OD交通需求沿最短经路一次分配到路网上去的方法，也被称为交通需求分配。顾名思义，全有（all）指将OD交通需求一次性地全部分配到最短路径上。全无（nothing）指对最短路径以外的路径不分配交通需求量*/ 信号控制路网交通流动态分配研究(4):http://www.751com.cn/tongxin/lunwen_3132.html