From e2ed5cc3f504c84499c60b26f427a891663e1bae Mon Sep 17 00:00:00 2001
From: trekhleb <3000285+trekhleb@users.noreply.github.com>
Date: Fri, 7 Nov 2025 21:43:21 +0100
Subject: [PATCH] Add Dijkstra algorithm illustrations and explanations

---
 src/algorithms/graph/dijkstra/README.md | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/src/algorithms/graph/dijkstra/README.md b/src/algorithms/graph/dijkstra/README.md
index 3576663e9..ec74531bf 100644
--- a/src/algorithms/graph/dijkstra/README.md
+++ b/src/algorithms/graph/dijkstra/README.md
@@ -83,6 +83,10 @@ If the node that we're visiting (in this case the node `C`) is already in the qu
 
 Now we now the shortest distances to ech node from the start node `A`. In practice, during the distance calculations we also record the the `previousVertices` for each node to be able to show the exact sequence of nodes that forms the shortest path.
 
+## Implementation example
+
+- [dijkstra.js](./dijkstra.js)
+
 ## References
 
 - [Wikipedia](https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm)