C#

public Hashtable FindShortestPath(string start, string end)
        {
            Dictionary<string, Node<T>> Q = new Dictionary<string, Node<T>>();
            Hashtable distance = new Hashtable();
            Hashtable route = new Hashtable();



            foreach (KeyValuePair<string, Node<T>> kvp in Nodes)
            {
                distance.Add(kvp.Key, Int32.MaxValue);
                route.Add(kvp.Key, null);
                Q.Add(kvp.Key, kvp.Value);
            }
      
            distance[start] = 0;

            while (Q.Count >= 0)
            {
                string minimumID = null;
                int minvalue = Int32.MaxValue;

                foreach (KeyValuePair<string, Node<T>> kvp in Q)
                {
                    if ((int)distance[kvp.Key] < minvalue)
                    {
                        minvalue = (int)distance[kvp.Key];
                        minimumID = kvp.Key;
                    }
                }

                foreach (Edge<T> e in EdgeList)
                {
                    if (e.startNode.ID == minimumID)
                    {
                        int startNodeDistance = (int)distance[minimumID];
                        int endNodeDistance = (int)distance[e.endNode.ID];

                        if (startNodeDistance + e.weight < endNodeDistance)
                        {
                            distance[e.endNode.ID] = startNodeDistance + e.weight;
                            route[e.endNode.ID] = minimumID;                          
                        }
                         
                    }
                    
                }
                 Q.Remove(minimumID);                                                                                                                                    
            }

            foreach(int k in route.Keys)
            {
                Console.WriteLine("k: " + route[k]);
            }

            return route;