Write an algorithm that finds a path from vertex a to vertex b in a directed graph by
Chapter 28, Problem 10(choose chapter or problem)
Write an algorithm that finds a path from vertex a to vertex b in a directed graph by using a slightly modified depth-first traversal. Segment 28.16 outlines an approach to this problem.
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