Algorithms in a Nutshell

(^154) | Chapter 6: Graph Algorithms
We assume that no arithmetic overflow occurs in line 12 of Figure 6-13; should
you be concerned, simply add a check that the computednewLen≥0.
Figure 6-13. Dijkstra’s Algorithm with priority queue fact sheet
Algorithms in a Nutshell
Algorithms in a Nutshell By Gary Pollice, George T. Heineman, Stanley Selkow ISBN:
9780596516246 Publisher: O'Reilly Media, Inc.
Prepared for Ming Yi, Safari ID: [email protected]
Licensed by Ming Yi
Print Publication Date: 2008/10/21 User number: 594243
© 2009 Safari Books Online, LLC. This PDF is made available for personal use only during the relevant subscription term, subject to the Safari Terms of Service. Any other use
Licensed by
Ming Yi