박권수 / Algorithm_HW5

Go to a project
Toggle navigation Toggle navigation pinning
박권수
110e4a39 1 parent c6bef59b

feature2.0.1 :define Dijkstra & edit Remark of Kruskal 

q
Inline Side-by-side
Showing 1 changed file with 5 additions and 4 deletions
...@@ -25,6 +25,7 @@ def union(r1, r2) : ...@@ -25,6 +25,7 @@ def union(r1, r2) :
25 if(rank[r1] == rank[r2]) : 25 if(rank[r1] == rank[r2]) :
26 rank[r2] += 1 26 rank[r2] += 1
27 27
28 +#define Kruskal Algorithm : input = graph
28 def Kruskal(graph) : 29 def Kruskal(graph) :
29 #n = 정점의 수 / m = 엣지의 수 30 #n = 정점의 수 / m = 엣지의 수
30 n = len(graph['vertices']) 31 n = len(graph['vertices'])
...@@ -58,13 +59,14 @@ def Kruskal(graph) : ...@@ -58,13 +59,14 @@ def Kruskal(graph) :
58 59
59 return F 60 return F
60 61
61 -#Dijkstra Algorithm 62 +#Dijkstra Algorithm : input = graph
62 - 63 +def dijkstra(w) :
64 + n = len(w)
63 65
64 66
65 67
66 68
67 -#Kruskal Algorithm 69 +#practice about Kruskal Algorithm
68 graph = { 70 graph = {
69 'vertices': ['A', 'B', 'C', 'D', 'E'], 71 'vertices': ['A', 'B', 'C', 'D', 'E'],
70 'edges': set([ 72 'edges': set([
...@@ -85,4 +87,3 @@ print('Kruskal Algorithm : ', "\n", mst) ...@@ -85,4 +87,3 @@ print('Kruskal Algorithm : ', "\n", mst)
85 inf = 1000 87 inf = 1000
86 w = [[0,7,4,6,1],[inf,0,inf,inf,inf], 88 w = [[0,7,4,6,1],[inf,0,inf,inf,inf],
87 [inf,2,0,5,inf], [inf,3,inf,0,inf], [inf,inf,inf,1,0]] 89 [inf,2,0,5,inf], [inf,3,inf,0,inf], [inf,inf,inf,1,0]]
88 -n = len(w)
......