Shortest path computation: OrientDB vs Neo4J vs ...?

Kia ora!

I’m developing a map-based system in Java that frequently requests the shortest path between any two of its 50k+ nodes. I have spent the past week or so implementing OrientDB, and its improvements over my previous, non-graph implementation are enormous (critically, it doesn’t crash).

However, what are the pros & cons of using Neo4J, ArangoDB, etc? Specifically, would a paid platform offer improved computation times of the shortest paths? I note that ArangoDB claims ~3x faster shortest path computation over OrientDB.