The Code-Bin
Links
Home
Add your code!
All Listings
About
Latest Entry
Featured Scripts
Author's Website
Latest Entries
FFMPEG Thumbnail Scr...
PHP, 0.8KB
Jul. 29, 10:24pm
John
Z80 Assembler, 190 bytes
Feb. 17, 3:36am
John
Z80 Assembler, 176 bytes
Sep. 13, 2:19am
John
Z80 Assembler, 77 bytes
Sep. 13, 2:18am
John
Z80 Assembler, 209 bytes
Sep. 13, 2:17am
Dijktra's Algorithm Implementation
Posted by: Paul | May 18, 2011 @ 6:19pm
Java Code
[
Download
]
private void shortestPath(Intersection start, List<Intersection> inters) { for(Intersection i : inters) { i.setK(false); i.setP(null); i.setD(INFINITY); } Heap<Intersection> h = new Heap<Intersection>(); start.setD(0.0); h.insert(start.getD(), start); do { Intersection i = h.remove(); if(i.isK() == false) { i.setK(true); for(Road r : i.getAdjacent()) { Intersection next = r.getIntersection2(); if(next.getD() > i.getD() + r.getCost(measure)) { next.setD(i.getD() + r.getCost(measure)); next.setP(i); h.insert(next.getD(), next); } } } } while(!h.isEmpty()); }
Syntax Highlighting
[
Open in new window
]
Author Comments
none
Rating
2.87 / 8
106 Votes