What is the most simple & efficient C# code for Dijkstra's shortest path algorithm?

The nodes represent locations in space. So each node has a location that the user specified when they add the node. The edges have weights. In particular, the weight of an edge between two nodes is the Euclidean distance between them. So if one node has a location (xi,y1) the another node has a location (x2,y2), then the weight of the edge between them is xx2) + 1-y2)2 Once again, you may use any representation of the graph you like (e.g. node objects with adjacency lists, array of adjacency lists, etc.). As with the last assignment, you may not represent the graph as one big list of all the edges. And you must be able to handle all undirected graphs: cyclic or acyclic, connected, or unconnected. Since you will be implementing Dijkstra and A, you'll need to implement a binary heap. You must write this yourself. However, you are still free to use the built-in collection classes of C#/.NET, such as List Ts, QueueT Dictionary, and Hashset