Trade-offs between different Dijkstra implementations?

It was suggested that I post this question here from the discord:

Can anyone shed some light on the following regarding the different Dijkstra implementations in graphalgo/impl/path/ versus graphalgo/impl/shortestpath/ : Why does the "path" implementation use the traversal framework while the shortestpath implementation does not? What are the trade-offs between the two implementations?

I am using Neo4j Community v3.5.9, Neo4j Graph Algorithms Library v3.5.9.0 and Neo4j Java Driver v1.7.5.