Builds a new Bellman Ford searcher.

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 EdgeMinimized event.

Raises the EdgeNotMinimized event.

Raises the EdgeNotRelaxed event.

Raises the EdgeRelaxed event.

Raises the ExamineEdge event.

Raises the InitializeVertex event.

Returns a String that represents the current Object.

Vertex color map

Constructed distance map

Constructed predecessor map

Edge weights

Invoked during the second stage of the algorithm, during the test of whether each edge was minimized. If the edge is minimized then this function is invoked.

Invoked during the second stage of the algorithm, during the test of whether each edge was minimized. If the edge was not minimized, this function is invoked. This happens when there is a negative cycle in the graph.

Invoked if the distance label for the target vertex is not decreased.

Invoked when the distance label for the target vertex is decreased. The edge that participated in the last relaxation for vertex v is an edge in the shortest paths tree.

Invoked on every edge in the graph |V| times.

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