// From https://letmetutoryou.wordpress.com/2009/05/26/shortest-path-with-dijkstra-and-c/

​

using System;

using System.Collections.Generic;

​

public class Program

{

    public static void Main()

    {

        Console.WriteLine("Hello World");

    }

}

​

class Dijkstra

{

    public List<Vertex> Vertices;

    public List<Edge> edges;

    // Constructor 

    public Dijkstra()

    {

        Vertices = new List<Vertex>(); // Holds the Vertices

        edges = new List<Edge>(); // Holds the connections

    }

​

    // Dijkstra calculation algorithm 

    public void Execute()

    {

        while (Vertices.Count > 0)

        {

            // For each smallset Vertex

            Vertex smallest = ExtractSmallest();

            // Get the adjacents 

            List<Vertex> adjacentVertices = AdjacentRemainingVertices(smallest);

            // for each adjacent Vertex calculate the distance

            int size = adjacentVertices.Count;

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

            {

                Vertex adjacent = adjacentVertices.ElementAt(i);

                float distance = Distance(smallest, adjacent) + smallest.distanceFromStart;

                if (distance < adjacent.distanceFromStart)

                {

                    adjacent.distanceFromStart = distance;

                    adjacent.previous = smallest;

                }

            }

        }

    }

    public Vertex ExtractSmallest(){

        // TODO

        return null;

    }

}

​

​

public class Vertex : IComparable<Vertex>

{

    public string Value

    {

        get;

        private set;

    }

​

    public IList<Edge> Adjacents

    {

        get;

        private set;

    }

​

    // Properties related to algo if allowed to edit a node

    // Distance from Start to this node

    public int Distance

    {

        get;

        set;

    }

​

    // The previous node to reach this node in the best way

    public Vertex PathVia

    {

        get;

        set;

    }

​

    public Vertex(string val)

    {

        Value = val;

        Adjacents = new List<Edge>();

        // By default, setthe distance to unknown

        Distance = int.MaxValue;

    }

​

    public Edge AddAdjacent(Vertex to, int weight)

    {

        var edge = new Edge(this, to, weight);

        Adjacents.Add(edge);

        return edge;

    }

    public int CompareTo(Node a)

    {

        return Distance.CompareTo(a.Distance);

    }

    public override string ToString(){

        return Value;

    }

}

​

public class Edge

{

    public Vertex From

    {

        get;

        private set;

    }

​

    public Vertex To

    {

        get;

        private set;

    }

​

    public int Weight

    {

        get;

        private set;

    }

​

    public Edge(Vertex from, Vertex to, int weight)

    {

        From = from;

        To = to;

        Weight = weight;

    }

}

​