# What is Dijkstra's shortest path algorithm?Algorithm Interview Questions set 1/Algorithm Interview Questions and Answers for Freshers & Experienced

## What is Dijkstra's shortest path algorithm?

Dijkstra's algorithm is an algorithm for finding the shortest path from a starting node to the target node in a weighted graph. The algorithm makes a tree of shortest paths from the starting vertex and source vertex to all other nodes in the graph.

Suppose you want to go from home to office in the shortest possible way. You know some roads are heavily congested and challenging to use this, means these edges have a large weight. In Dijkstra's algorithm, the shortest path tree found by the algorithm will try to avoid edges with larger weights.

Posted Date:- 2021-09-09 22:09:40

##### R4R Team
R4R provides Algorithm Freshers questions and answers (Algorithm Interview Questions and Answers) .The questions on R4R.in website is done by expert team! Mock Tests and Practice Papers for prepare yourself.. Mock Tests, Practice Papers,Algorithm Interview Questions set 1,Algorithm Freshers & Experienced Interview Questions and Answers,Algorithm Objetive choice questions and answers,Algorithm Multiple choice questions and answers,Algorithm objective, Algorithm questions , Algorithm answers,Algorithm MCQs questions and answers R4r provides Python,General knowledge(GK),Computer,PHP,SQL,Java,JSP,Android,CSS,Hibernate,Servlets,Spring etc Interview tips for Freshers and Experienced for Algorithm fresher interview questions ,Algorithm Experienced interview questions,Algorithm fresher interview questions and answers ,Algorithm Experienced interview questions and answers,tricky Algorithm queries for interview pdf,complex Algorithm for practice with answers,Algorithm for practice with answers You can search job and get offer latters by studing r4r.in .learn in easy ways .