Does DeltaStepping algorithm return the same result like Dijkstra Algorithm

Question

I am using the java graph library JGraphT to compute the shortest path on an directed, weighted Graph where the weights are non-negative.

For now I was using Dijkstra