Dijkstra's Algorithm is a graph search algorithm that finds the shortest path between nodes in a weighted graph, ensuring all edge weights are non-negative. It uses a priority queue to explore nodes with the smallest known distance, updating paths as shorter ones are discovered until the shortest path to the target node is identified.

Dijkstra's Algorithm

graph search algorithm

The shortest path problem involves finding the most efficient route between two points in a graph, minimizing the total distance or cost. It is a fundamental concept in computer science and operations research, with applications in network routing, logistics, and urban planning.

shortest path

nodes in a weighted graph

edge weights

A priority queue is an abstract data type similar to a regular queue or stack data structure, but where each element has a priority assigned to it. Elements with higher priorities are served before elements with lower priorities, and if two elements have the same priority, they are served according to their order in the queue.

CUSTOMIZE YOUR LEARNING

CUSTOMIZE YOUR LEARNING

Relevant Degrees

Log in to see lessons