Can somebody please explain and provide pseudocode for the Dijkstra

algorithm?

I'm trying to implement the Dijkstra shortest path algorithm. However, I'm

finding it extremely difficult to understand.

I've a node class that hold the node name, and the x,y coordinate.

I've an edge class the takes two(2) nodes, from and to, and a name for the

edge.

I'm using only simple arrays to store the nodes and the edges, no priority

queues.

I've also read the pseudocode on:

http://en.wikipedia.org/wiki/Dijkstra's_algorithm

but find it too mathematical.

Can somebody please provide me with pseudocode and comments/exlanation that

uses simple arrays and programming contructs?

Many thanks

James