Merge pull request #240 from AlgoLeadMe/27-H0ngJu

27-H0ngJu

H0ngJu/DFS/트리의 지름.py

@@ -0,0 +1,28 @@
+import sys
+sys.setrecursionlimit(10**9)
+def input() : return sys.stdin.readline().rstrip()
+
+n = int(input())
+tree = [[] for _ in range(n+1)]
+visited = [-1] * (n+1)
+visited[1] = 0
+
+for i in range(n-1):
+    v, u, w = map(int, input().split())
+    tree[v].append((u, w))
+    tree[u].append((v, w))
+
+def dfs(start, dis):
+    for node, node_dis in tree[start]:
+        if visited[node] == -1:
+            visited[node] = dis + node_dis
+            dfs(node, dis + node_dis)
+
+dfs(1,0)
+
+far_node = visited.index(max(visited))
+visited = [-1] * (n+1)
+visited[far_node] = 0
+dfs(far_node, 0)
+
+print(max(visited))

H0ngJu/README.md

@@ -28,5 +28,6 @@
 | 24차시 | 2024.08.17 | BFS | [아기상어](https://www.acmicpc.net/problem/16236) | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/233 |
 | 25차시 | 2024.08.17 | DFS | [친구비](https://www.acmicpc.net/problem/16562) | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/234 |
 | 26차시 | 2024.08.24 | 그리디 | [신입사원](https://www.acmicpc.net/problem/1946) | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/237 |
+| 27차시 | 2024.08.27 | DFS | [트리의 지름](https://www.acmicpc.net/problem/1967) | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/240 |
 
 ---