Dijkstra’s algorithm

Please read this blogger, he did a great job, his explanation of Dijkstra’s Algorithm is quite clear.

My purpose to write this piece of the article: to make this algorithm simpler and clearer.

Dijkstra’s algorithm purpose: to calculate the shortest path from a starting node/vertex to all other nodes in the graph.




System engineer

Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

Keycloak & Spring Boot

Full Stack Web Development

Read vault’s secrets from Jenkin’s declarative pipeline

How Sober Social came to life

Running Docker containers in Azure Kubernetes Service cluster

Data Structure in C++ Beginner Guide Part 1 — Data Types

Hamiltonian Path and Cycle in the graph using Backtracking.

Introduction to GitOps with ArgoCD

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store


System engineer

More from Medium

LeetCode Patterns Adventure 10— Linked List Cycle

Sorting Algorithms Explained Using Python: Bucket Sort

Glass Cube and Dots

Basic Data Structure and Algorithms in Python

Hackerrank — Sherlock and the Valid String walkthrough #Python #Hackerrank