Builds a new Dagsearcher.

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.

Triggers the DiscoverVertex event

Triggers the EdgeNotRelaxed event

Triggers the EdgeRelaxed event

Triggers the ExamineEdge event

Triggers the ExamineVertex event

Triggers the FinishVertex event

Triggers the InitializeVertex event

Returns a String that represents the current Object.

Vertex color map

Constructed distance map

Constructed predecessor map

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 added to set S.

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.