using System;

using System.Collections.Generic;

​

public class Edge

{

    public int Source { get; set; }

    public int Dest { get; set; }

    public int Weight { get; set; }

}

​

public class Program

{

    const int NUM_NODES = 11;

    public static void Main()

    {

        var p = new Program();

        var edges = new List<Edge>();

        var graph = new int[,]

                    {{ 0, 4, 0, 0, 0, 0, 0, 4, 5, 0, 0 },

{ 0, 0, 6, 0, 0, 0, 0, 0, 0, 4, 0 },

{ 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0 },

{ 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0 },

{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },

{ 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0 },

{ 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0 },

{ 0, 0, 0, 0, 0, 0, 4, 0, 0, 4, 0 },

{ 0, 0, 3, 0, 0, 0, 2, 0, 0, 1, 0 },

{ 0, 0, 0, 7, 0, 1, 0, 0, 0, 0, 3 },

{ 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0 }};

        // build vertices from graph array

        for (var i = 0; i < NUM_NODES; i++) {

            for (var j = 0; j < NUM_NODES; j++) {

                if (graph[i,j] == 0) continue;

                var edge = new Edge();

                edge.Source = i;

                edge.Dest = j;

                edge.Weight = graph[i,j];

                edges.Add(edge);

            }

        }

        p.BellmanFord(graph, 0);

    }

    public void PrintArray(int[] array) {

        for (var x = 0; x < array.GetLength(0); x++) {

            Console.Write(array[x].ToString().PadRight(3, ' '));

        }

        Console.WriteLine();

    }

​

    public void PrintArray(int[,] array) {

        for (var x = 0; x < array.GetLength(0); x++) {

            for (var y = 0; y < array.GetLength(1); y++) {

                Console.Write(array[x, y].ToString().PadRight(3, ' '));

            }

            Console.WriteLine();

        }

    }

    public void BellmanFord(int[,]graph, int start) {

        var distance = new int[NUM_NODES];

        var visited=new bool[NUM_NODES];

        // initialize distances and visited list

        for (var i = 0; i < NUM_NODES; i++) {

            distance[i] = int.MaxValue;

            visited[i] = false;

        }

        distance[start] = 0;

       while(start!=-1){

                 for(int i=0; i<NUM_NODES; i++)

      if((graph[start,i]+distance[start]<distance[i])&&graph[start,i]!=0)

        distance[i] = graph[start,i]+distance[start];

           visited[start] = true; start = -1;

    int mindistance = int.MaxValue;

    for(int i=0; i<NUM_NODES; i++)

      if(!visited[i] && (distance[i] < mindistance)){

        start = i; mindistance = distance[i];

      }

    }

        // display results

        PrintArray(distance);

    }

}