Mossy Oak Prom Dresses

Extra Points "Dijkstra Algorithm"



Dijkstra Algorithm:

In this algorithm, algorithm is also called the "shortest path" as it is to find and take 1 of the " n " possible ways to reach the goal, the path chosen should be the lowest cost, and is a of time, effort, distance, etc, if it s possible these features together in one camnino, then the algorithm would be more optimal yet.

is common to represent this algorithm with a graph, as shown in the example:

• vertices are listed to identify each point .
• edges are listed according to their weight or cost.
• starts from a base vertex, or vertex output.
• After setting a goal.
• Then the algorithm begins to recognize all possible paths to choose, for starters.
• Take the path of least cost or shortest.
• So on until the final point or goal.
• The sum of the total cost of the algorithm, it is therefore

  , the most optimal, since chosen the path that suited him.

That helps me??

If we realize this algorithm is more common than their name appears, since we use very often, if we reflect on either side that we think carefully what is the best way get to that place, either on how to get faster, how to get more cheaply or how to reach with the least effort and if possible one that meets all these requirements.

But focusing on my career, this algorithm is way too utlil, because today we could say that time is money, that is, the time is worth much, then I is very useful dominate this algorithm to apply to my career development as there are companies that pay very well that the job done on time and that is quality, and this algorithm is a very good reference to build on this aspect.

Video

Explanation:

The video above shows a robot, which is a deterministic machine that first recognizes the place where you are, then, by a computer linked to the robot, you assign points or goals to reach, and the robot travels the path that best suits you in this case the most optimal.