init Dijkstra Algorithm

@@ -58,6 +58,11 @@ def Kruskal(graph) :
 
     return F
 
+#Dijkstra Algorithm
+
+
+
+
 
 #Kruskal Algorithm
 graph = {
@@ -74,4 +79,10 @@ graph = {
         }
 
 mst = Kruskal(graph)
-print('Kruskal Algorithm : ', "\n", mst)
\ No newline at end of file
+print('Kruskal Algorithm : ', "\n", mst)
+
+#Dijkstra Algorithm
+inf = 1000
+w = [[0,7,4,6,1],[inf,0,inf,inf,inf],
+   [inf,2,0,5,inf], [inf,3,inf,0,inf], [inf,inf,inf,1,0]]
+n = len(w)