How can I find the nodes of the shortest path using bellmanford algorithm

Question

I implemented this Bellman-Ford algorithm to find the shortest path between two nodes, the problem here that I want it to return also the nodes of the shortest path between