Find a shortest path P: s --> t and its length by Moore's BFS
Chapter 23, Problem 23.2(choose chapter or problem)
Find a shortest path P: s --> t and its length by Moore's BFS algorithm; si--erch the graph with the labels and indicate P by heavier lines (as in Fig. 481).
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer