Typically, I know Bellman-Ford finds the shortest path between the source vertex and every other vertex. My question is, if trying to get the full path length i.e starting with a vertex and ending with the same vertext e.g starting with USD in a trade path and making sure to end the path with USD (same currency in and out), do I need to perform the relaxation again?