Oracle Community Directory
Oracle Community FAQ
My Oracle Support Community (MOSC)
Go Directly To
Oracle Technology Network Community
My Oracle Support Community
OPN Cloud Connection
Oracle Employee Community
Oracle User Group Community
OTN Speaker Bureau
Please enter a title.
You can not post a blank message. Please type your message and try again.
This discussion is archived
: Dec 18, 2007 9:03 PM by
dijkstra's algorithm for shortest path
Dec 18, 2007 8:16 PM
can it be implemented using just a regular queue or does it have to be a priority queue..... the number of items in my graph is only 12... thank you
This content has been marked as final.
Show 1 reply
Re: dijkstra's algorithm for shortest path
Dec 18, 2007 9:03 PM
in response to
you need to be able to extract the unvisited vertex with the minimal distance. the most efficient way to do this is with a priority queue