How to find the shortest path between two vertices in a graph?

Question

C++ / C#

Task: find the shortest path between two vertices of a weighted undirected graph and output it as a sequence of vertices. The graph is given by the adjacency matrix.
I use the Floyd-Warshall algorithm for finding the shortest paths between all pairs of vertices
( e-maxx.ru/algo/floyd_warshall_algorithm).

for (int k=0; k<n; ++k)
  for (int i=0; i<n; ++i)
    for (int j=0; j<n; ++j)
      d[i][j] = min (d[i][j], d[i][k] + d[k][j]);

Question: how to restore paths? The link says about "a simple recursive algorithm for restoring the shortest path". But I can't write it.

Answer 1

www.youtube.com/watch?v=DmrFwLcDl9c