DijkstraAlgo, C# - rextester

Language: Layout:

//Rextester.Program.Main is the entry point for your code. Don't change it.
//Compiler version 4.0.30319.17929 for Microsoft (R) .NET Framework 4.5

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text.RegularExpressions;

namespace Rextester
{
    public class Program
    {
        class Dijkstra
    {
 
        private static int MinimumDistance(int[] distance, bool[] shortestPathTreeSet, int verticesCount)
        {
            int min = int.MaxValue;
            int minIndex = 0;
 
            for (int v = 0; v < verticesCount; ++v)
            {
                if (shortestPathTreeSet[v] == false && distance[v] <= min)
                {
                    min = distance[v];
                    minIndex = v;
                }
            }
 
            return minIndex;
        }
            
            private static void Print(int[] distance, int verticesCount)
        {
            Console.WriteLine("Vertex    Distance from source");

for (int i = 0; i < verticesCount; ++i)
                Console.WriteLine("{0}\t  {1}", i, distance[i]);
        }
            
            
            public static void DijkstraAlgo(int[,] graph, int source, int verticesCount)
        {
            int[] distance = new int[verticesCount];
            bool[] shortestPathTreeSet = new bool[verticesCount];

for (int i = 0; i < verticesCount; ++i)
            {
                distance[i] = int.MaxValue;
                shortestPathTreeSet[i] = false;
            }

distance[source] = 0;

for (int count = 0; count < verticesCount - 1; ++count)
            {
                int u = MinimumDistance(distance, shortestPathTreeSet, verticesCount);
                shortestPathTreeSet[u] = true;

for (int v = 0; v < verticesCount; ++v)
                    if (!shortestPathTreeSet[v] && Convert.ToBoolean(graph[u, v]) && distance[u] != int.MaxValue && distance[u] + graph[u, v] < distance[v])
                        distance[v] = distance[u] + graph[u, v];
            }

Print(distance, verticesCount);
        }
        public static void Main(string[] args)
        {
            int[,] graph =  {
	                        { 0, 6, 0, 0, 0, 0, 0, 9, 0 },
	                        { 6, 0, 9, 0, 0, 0, 0, 11, 0 },
	                        { 0, 9, 0, 5, 0, 6, 0, 0, 2 },
	                        { 0, 0, 5, 0, 9, 16, 0, 0, 0 },
	                        { 0, 0, 0, 9, 0, 10, 0, 0, 0 },
	                        { 0, 0, 6, 0, 10, 0, 2, 0, 0 },
	                        { 0, 0, 0, 16, 0, 2, 0, 1, 6 },
	                        { 9, 11, 0, 0, 0, 0, 1, 0, 5 },
	                        { 0, 0, 2, 0, 0, 0, 6, 5, 0 }
                            };

DijkstraAlgo(graph, 0, 9);
        }
    }
}
        }

Show compiler warnings [ + ] Show input
Compilation time: 0,12 sec, absolute running time: 0,11 sec, cpu time: 0,12 sec, average memory usage: 17 Mb, average nr of threads: 2, absolute service time: 0,25 sec