feature2.0.1 :define Dijkstra & edit Remark of Kruskal

q

@@ -25,6 +25,7 @@ def union(r1, r2) :
             if(rank[r1] == rank[r2]) :
                 rank[r2] += 1
 
+#define Kruskal Algorithm : input = graph
 def Kruskal(graph) :
     #n =  정점의 수 / m = 엣지의 수
     n = len(graph['vertices'])
@@ -58,13 +59,14 @@ def Kruskal(graph) :
 
     return F
 
-#Dijkstra Algorithm
-
+#Dijkstra Algorithm : input = graph
+def dijkstra(w) :
+    n = len(w)
 
 
 
 
-#Kruskal Algorithm
+#practice about Kruskal Algorithm
 graph = {
         'vertices': ['A', 'B', 'C', 'D', 'E'],
         'edges': set([
@@ -85,4 +87,3 @@ print('Kruskal Algorithm : ', "\n", mst)
 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)