We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I keep timing out on Test Case #7. In Java I'm using an arraylist of hashmaps to keep track of the edge weights, and a priority queue of neighbor vertices to select which to visit next.
Any general advice how to get it to perform faster? Let me know if I should just post the code.
Dijkstra: Shortest Reach 2
You are viewing a single comment's thread. Return to all comments →
I keep timing out on Test Case #7. In Java I'm using an arraylist of hashmaps to keep track of the edge weights, and a priority queue of neighbor vertices to select which to visit next.
Any general advice how to get it to perform faster? Let me know if I should just post the code.