Johnsons algorithm is used to find the shortest path in a directed weighted graph. The weights in the graph can be negative. However, if all of the weights in the graph are already positive is it still necessary to run the Bellman-Ford step in Johnsons Algorithm? Could you jump directly to running Dijkstra’s Algorithm since there is no possibility of a negative weight cycle?