The Artima Developer Community
Sponsored Link

Java Buzz Forum
Make Your Dijkstra Faster

0 replies on 1 page.

Welcome Guest
  Sign In

Go back to the topic listing  Back to Topic List Click to reply to this topic  Reply to this Topic Click to search messages in this forum  Search Forum Click for a threaded view of the topic  Threaded View   
Previous Topic   Next Topic
Flat View: This topic has 0 replies on 1 page
Peter Karich

Posts: 468
Nickname: pettar
Registered: Apr, 2008

Peter Karich is Physicist and Java Software Developer
Make Your Dijkstra Faster Posted: Dec 3, 2012 1:54 PM
Reply to this message Reply

This post originated from an RSS feed registered with Java Buzz by Peter Karich.
Original Post: Make Your Dijkstra Faster
Feed Title: Java and more ...
Feed URL:
Feed Description: Just another weblog. Its about my developer experiences with Java in general. In detail I will blog about NetBeans, Eclipse, Design Patterns, News, Web Frameworks and other tools. My focus will be open source tools, which make the life of a Java developer easier.
Latest Java Buzz Posts
Latest Java Buzz Posts by Peter Karich
Latest Posts From Java and more ...

Today I stumbled over yet another minor trick which could speed up the execution of the Dijkstra algorithm. Let me shortly introduce this shortest path algorithm: If you need the path (and not only the shortest path tree) you will give the method an additional toNode parameter and compare this to distEntry.node to break the … Continue reading »

Read: Make Your Dijkstra Faster

Topic: Guava’s Objects Class: Equals, HashCode, and ToString Previous Topic   Next Topic Topic: The Final IntelliJ IDEA 12 EAP 123.23 Before RC

Sponsored Links


Copyright © 1996-2018 Artima, Inc. All Rights Reserved. - Privacy Policy - Terms of Use