Added `tfind_path` function

- Will find the shortest path for undirected graphs if `parents` comes from a
  BFS (since BFS `parents` will always be the shortest path on an unweighted /
uniformly weighted graph)