How much time does Dijkstra computation last?

Topics: algorithm
Sep 23, 2008 at 6:31 AM
Hello all

I have some problems with the performance of my autorouting application. The graph (AdjacencyGraph) contains over 56.000 edges and 16.000 vertices. It consumes 40 seconds to calculate the shortest path.But it is too much time. I thought to store or serialize the graph but every time the application is launched,  the graph is new. How can I improve it?

Thank you so much

Pavleras

Coordinator
Sep 23, 2008 at 12:09 PM
Profile your application to measure where you spend your time. Is the problem to build the graph or actually to compute Dijkstra?