Builds a new Dijsktra searcher.

Computes all the shortest path from s to the oter vertices

Determines whether the specified Object is equal to the current Object.

Allows an Object to attempt to free resources and perform other cleanup operations before the Object is reclaimed by garbage collection.

Serves as a hash function for a particular type.

Gets the Type of the current instance.

Creates a shallow copy of the current Object.

Raises the EdgeNotRelaxed event.

Raises the EdgeRelaxed event.

Add event handlers to the corresponding events.

Register the predecessor handlers

Returns a String that represents the current Object.

Create a edge unary weight dictionary.

Create a edge unary weight dictionary.

Vertex color map

Constructed distance map

Vertex priorithized queue. Used internally.

Visited graph

Invoked on vertex v when the edge (u,v) is examined and v is WHITE. Since a vertex is colored GRAY when it is discovered, each reachable vertex is discovered exactly once. This is also when the vertex is inserted into the priority queue.

Invoked if the edge is not relaxed. .

invoked on edge (u,v) if d[u] + w(u,v) < d[v]. The edge (u,v) that participated in the last relaxation for vertex v is an edge in the shortest paths tree.

Invoked on each out-edge of a vertex immediately after it has been added to set S.

Invoked on a vertex as it is removed from the priority queue and added to set S. At this point we know that (p[u],u) is a shortest-paths tree edge so d[u] = delta(s,u) = d[p[u]] + w(p[u],u). Also, the distances of the examined vertices is monotonically increasing d[u1] <= d[u2] <= d[un].

Invoked on a vertex after all of its out edges have been examined.

Invoked on each vertex in the graph before the start of the algorithm.