How to find the shortest path in a graph by breadth-first search?

Question

Algorithms

In the description of the breadth-first search algorithm, it says "so you will find the shortest path to a given point"
But in fact, I just find out if there is a given node in the graph or not.
How can I find out the path? (list of nodes through which the path goes)

Answer 1

When adding a node to the bypass queue, mark from which node you came to it. Once you have reached your destination, reverse the route.