My code to find the shortest path via the Floyd-Warshall algorithm is working, but what I need is to actually store the path that is taken, not just the minimum value/cost/d
