最短路径(Dijkstra)算法 之 .Net 4.0 Parallel 实现

Program.cs

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace ParallelDijkstra
{
    class Program
    {
        static void Main(string[] args)
        {
            int[,] c=new int[5,5];

            Parallel.For(0, 5, (i) =>
                {
                    Parallel.For(0, 5, (j) =>
                        {
                            c[i,j] = Dijkstra.MaxInt;
                        }
                     );
                }
            );

            c[0, 1] = c[1, 0] = 10;
            c[0, 3] = c[3, 0] = 30;
            c[0, 4] = c[4, 0] = 100;
            c[1, 2] = c[2, 1] = 50;
            c[2, 4] = c[4, 2] = 10;
            c[3, 2] = c[2, 3] = 20;