dijkstras algorithm

[Please support Stackprinter with a donation]

[-1] [1]
gcc

[2010-05-28 20:51:58]

[
algorithm
]

[ http://stackoverflow.com/questions/2932451]
[DELETED]

Can I use "Dijkstra's algorithm" to find distribution of probabilities of some events (example "biased dice","male death probability")? If I can, how?

Also, can anyone explain following sentence with more example:
`Dijkstra's algorithm is for finding shortest paths in certain types of weighted graphs`

[+3]
[2010-05-28 20:57:03]
Rowland Shaw
[ACCEPTED]

Dijkstra's algorithm is for finding the cheapest path across a network (be it fastest, shortest, etc.) It's not about probabilities, so no.

Curious to know why this attracted an anonymous downvote... - ** Rowland Shaw**

1

lukegccChris Farmeruser207442JaxidianKenaGuru`nodes`

and the bridges are`edges`

and the fees are`costs`

-nategoose`nodes`

and`edges`

(and optionally`costs`

and`direction`

and other properties of edges) is known as a`graph`

in Mathematics. You can model many things as a graph besides islands and bridges, and it is possible (even likely) that Dijkstra's algorithm may be useful for working out the most probable occurrence out of a set of possibilities. Since this is not the most straightforward application of Dijkstra's algorithm you probably need to become familiar with using it for islands and bridges before even trying to use it for probabilities. -nategooseMark Byers