From bec3a554b9fdd637f5c5831dde40e74ac81d37a9 Mon Sep 17 00:00:00 2001
From: Arjun Kumar <50614410+arjunkumar09@users.noreply.github.com>
Date: Tue, 9 Aug 2022 19:29:36 +0530
Subject: [PATCH] Added One Useful Resource Under Dijkstra Section (#210)

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 42cc15872..50328e00f 100644
--- a/README.md
+++ b/README.md
@@ -341,7 +341,7 @@ $ ./make_deb.sh
 ### Dijkstra
 
 [Graph Dijkstras Shortest Path Algorithm(Dijkstra's Shortest Path)](https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm)
-**Dijkstra's Algorithm** is used to find the shortest path from a source node to all other reachable nodes in the graph. The algorithm initially assumes all the nodes are unreachable from the given source node so we mark the distances of all nodes as infinity.
+**[Dijkstra's Algorithm]**(https://www.interviewbit.com/blog/find-shortest-path-dijkstras-algorithm/) is used to find the shortest path from a source node to all other reachable nodes in the graph. The algorithm initially assumes all the nodes are unreachable from the given source node so we mark the distances of all nodes as infinity.
 (infinity) from source node (INF / infinity denotes unable to reach).
 
 ### Dial