Question

Give an example of a directed graph G = (V, E), a source vertex s ¬ V, and a set of tree edges E π ¬ E such that for each vertex v ¬ V, the unique path in the graph (V, E π) from s to v is a shortest path in G, yet the set of edges E π cannot be produced by running BFS on G, no matter how the vertices are ordered in each adjacency list.

$1.99
Sales1
Views1120
Comments0
  • CreatedJuly 14, 2010
  • Files Included
Post your question
5000