Dijkastra Algorithm Essay

DIJKASTRA ALGORITHM

There are many algorithms to find shortest path between two vertexes in weighted graph. The Dijkastra algorithm is one of them.

The concept of Dijkastra algorithm was given by a Dutch computer scientist “Edsger Dijkastra” in 1956 and published in 1959. It is also graph search algorithm that solves the single-shortest path (minimum weight) problems, for a graph with non-negative edge path distance.

Single-source shortest path problem

Given as input a weighted graph, G= (V, E) and V for vertex, E for the edge, find the shortest weighted path from A to successive vertices,until z is reached.

The paths starting at A that contain no vertex other than A (until terminal vertex is reached) are a,b and a,d etc.

It is producing

A non-deterministic RNG produces output is dependent on some changeable physical source that is outside human control.

Physical method of Random Number:

• True random numbers can only be generated by observations of random physical events, like dice throws, coins, dice, roulette wheels Radioactive decay, thermal noise, and fish tank bubbles.

• They are slow and impractical Generation.

Applications of Random Numbers:

Computer generated “Random Numbers” are used in many application. Such as,

• Cryptography, games, and many statistical models rely on random numbers.

• Example from cryptography – keys for encryption of data.

• Example from games – the behavior of a computer-controlled character.

• Example from statistics - the Monte Carlo method.

What is a Random Number Genrator:

Most Random number generators a sequence of integers by the following recurrence:

Computational method to generates random numbers is Xn+1 = (P1 Xn + P2) Mod N

The parameters P1, P2, and N determine the characteristics of the random number generator, and the choice of X0 (the seed) determines the particular sequence of random numbers that is