In Exercises $6265,$use the breadth$-$first search algorithm for directed graphs $($see Exercise $61)$ to determine the

distance and a shortest directed path from S to A in the directed graph.