dijkstra/prim's algorithm...a little help?

Posted by bfpri on Stack Overflow See other posts from Stack Overflow or by bfpri
Published on 2010-04-28T15:18:32Z Indexed on 2010/04/28 15:33 UTC
Read the original article Hit count: 567

Filed under:

dijkstra

|

algorithm

I was wondering for dijkstra's and prim's algorithm, what happens when they are choosing between more than one vertex to go to ,and there are more than one vertex with the same weight.

For example

Example Image

© Stack Overflow or respective owner

Related posts about dijkstra

Dijkstra's Bankers Algorithm

as seen on Stack Overflow - Search for 'Stack Overflow'
Could somebody please provide a step-through approach to solving the following problem using the Banker's Algorithm? How do I determine whether a "safe-state" exists? What is meant when a process can "run to completion"? In this example, I have four processes and 10 instances of the same resource… >>> More
Big problem with Dijkstra algorithm in a linked list graph implementation

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi, I have my graph implemented with linked lists, for both vertices and edges and that is becoming an issue for the Dijkstra algorithm. As I said on a previous question, I'm converting this code that uses an adjacency matrix to work with my graph implementation. The problem is that when I find… >>> More
What algorithms did Dijkstra develop?

as seen on Stack Overflow - Search for 'Stack Overflow'
I recently asked a question about one of the Dijkstra’s algorithms (shunting-yard). But almost everyone thought "Dijkstra's algorithm" meant his shortest path algorithm. What other algorithms has Dijkstra developed? >>> More
Am I right about the differences between Floyd-Warshall, Dijkstra's and Bellman-Ford algorithms?

as seen on Programmers - Search for 'Programmers'
I've been studying the three and I'm stating my inferences from them below. Could someone tell me if I have understood them accurately enough or not? Thank you. Dijkstra's algorithm is used only when you have a single source and you want to know the smallest path from one node to another, but fails… >>> More
Do we still have a case against the goto statement? [closed]

as seen on Programmers - Search for 'Programmers'
Possible Duplicate: Is it ever worthwhile using goto? In a recent article, Andrew Koenig writes: When asked why goto statements are harmful, most programmers will say something like "because they make programs hard to understand." Press harder, and you may well hear something like "I don't… >>> More

Related posts about algorithm

Jpeg Algorithm vs BMP Algorithm?

as seen on Super User - Search for 'Super User'
I'm just wonder, what the differences are between creating a BMP file algorithm and JPG file algorithm ? If you know the others images' format algorithm, please post them. Thanks. >>> More
word disambiguation algorithm (Lesk algorithm)

as seen on Stack Overflow - Search for 'Stack Overflow'
Hii.. Can anybody help me to find an algorithm in Java code to find synonyms of a search word based on the context and I want to implement the algorithm with WordNet database. For example, "I am running a Java program". From the context, I want to find the synonyms for the word "running", but the… >>> More
Search algorithm (with a sort algorithm already implemented)

as seen on Stack Overflow - Search for 'Stack Overflow'
Hello, Im doing a Java application and Im facing some doubts in which concerns performance. I have a PriorityQueue which guarantees me the element removed is the one with greater priority. That PriorityQueue has instances of class Event (which implements Comparable interface). Each Event is associated… >>> More
Is there any algorithm for finding LINES by PIXEL COLORS on picture?

as seen on Stack Overflow - Search for 'Stack Overflow'
So I have Image like this I want to get something like this (I hevent drawn all lines I want but I hope you can get my idea) I need algorithm for finding all straight lines on it by just reading colors of pixels. No hard math, no Haar, no Hough. Some algorithm which would be based on points… >>> More
collsion issues with quadtree [on hold]

as seen on Game Development - Search for 'Game Development'
So i implemented a Quad tree in Java for my 2D game and everything works fine except for when i run my collision detection algorithm, which checks if a object has hit another object and which side it hit.My problem is 80% of the time the collision algorithm works but sometimes the objects just go… >>> More