final
Retrieves the shortest path from the start to target node (if a target was specified) during the most recent search operation (BFS, shortestPathsFrom). After topologicalSort(), it holds the topological ordering.
Return
A list of nodes representing the final path or null if no path was found. Running dfs() clears it. Note: Starting at a node, does not count as a path to that node