Computes the bfs starting at s

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

Raises the DiscoverVertex event.

Raises the ExamineEdge event.

Raises the ExamineVertex event.

Raises the FinishVertex event.

Raises the GrayTarget event.

Raises the InitializeVertex event.

Raises the NonTreeEdge event.

Raises the TreeEdge event.

Registers the predecessors handler

Returns a String that represents the current Object.

Computes the bfs starting at s without initalization.

Gets the IVertex to GraphColordictionary

Visited graph

Invoked (in addition to NonTreeEdge()) if the target vertex is colored black at the time of examination. The color black indicates that the vertex is no longer in the queue.

Invoked the first time the algorithm encounters vertex u. All vertices closer to the source vertex have been discovered, and vertices further from the source have not yet been discovered.

Invoked on every out-edge of each vertex immediately after the vertex is removed from the queue.

Invoked in each vertex as it is removed from the queue

Invoked after all of the out edges of u have been examined and all of the adjacent vertices have been discovered.

Invoked (in addition to non_tree_edge()) if the target vertex is colored gray at the time of examination. The color gray indicates that the vertex is currently in the queue.

Invoked on every vertex before the start of the search

Invoked (in addition to examine_edge()) if the edge is not a tree edge.

Invoked (in addition to ExamineEdge()) if the edge is a tree edge. The target vertex of edge e is discovered at this time.