graph/shortest_path/restore_path.hpp

• View this file on GitHub
• Last update: 2022-10-21 18:11:46+09:00
• Include: #include "graph/shortest_path/restore_path.hpp"

Required by

• graph/tree_center.hpp
• graph/tree_diameter.hpp

Verified with

• test/library_checker/graph/shortest_path.test.cpp
• test/library_checker/tree/tree_diameter.test.cpp

Code

vector<int> restore_path(vector<int> par, int t){
  vector<int> pth = {t};
  while (par[pth.back()] != -1) pth.eb(par[pth.back()]);
  reverse(all(pth));
  return pth;
}

#line 1 "graph/shortest_path/restore_path.hpp"
vector<int> restore_path(vector<int> par, int t){
  vector<int> pth = {t};
  while (par[pth.back()] != -1) pth.eb(par[pth.back()]);
  reverse(all(pth));
  return pth;
}

Back to top page