Efficiently finding the shortest path in large graphs

Question

I\'m looking to find a way to in real-time find the shortest path between nodes in a huge graph. It has hundreds of thousands of vertices and millions of edges. I know this

Answer 1

store in neo4j

It's include Dijkstra, A*, "shortest path" algorithms.