(5) Dijkstras Shortest Path Algorithm Explained | With Example | Graph Theory

HONESTLY THIS IS PRACTICE SO JUST PRACTICE LOOKING AT VIDEOS AND QUESTIONS

Dijkstra's Algorithm

An algorithm used to find the shortest path from a fixed starting node to all other nodes in a graph with weighted edges.

Graph

A collection of nodes connected by edges, which can have weights representing distances or costs.

Weighted Edges

Edges in a graph that have associated weights, indicating the cost or distance to travel between connected nodes.

Tentative Distance Value

An initial estimate of the shortest distance from the starting node to a given node, which gets updated throughout the algorithm.

Unvisited Nodes

Nodes in the graph that have not yet been processed by the algorithm.

Visited Nodes

Nodes that have been processed and have their shortest distance calculated.

Current Node

The node in the graph currently being evaluated to find and update the shortest path.

Previous Node

The node that led to the shortest distance for the current node during the algorithm's execution.

Current Shortest Distance

The shortest known distance from the starting node to a given node, updated as the algorithm progresses.

Shortest Path Reconstruction

The process of tracing back from the destination node to the starting node using the previous nodes stored during the algorithm.

Infinity

A value representing an unreachable distance in the context of Dijkstra’s algorithm, used as the initial distance for unvisited nodes.

Iteration

A single cycle of processing in an algorithm, where certain updates or calculations are made.

Algorithm Completion

The point at which all nodes have been visited and the shortest distances to all nodes from the starting node have been found.