Lv3_가장먼노드

Author: wh2per

Programmers/Lv3/Lv3_가장먼노드.cpp

@@ -0,0 +1,50 @@
+#include <string>
+#include <vector>
+#include <queue>
+#include <list>
+#include <algorithm>
+#include <limits>
+using namespace std;
+
+// 다익스트라 알고리즘보다 BFS가 훨씬 빠름.
+// 가중치가 1일 때는 BFS를 이용하자!
+
+int solution91(int n, vector<vector<int>> edge) {
+	int answer = 0;
+	int inf = 0;
+	vector<list<int> > graph(n+1, list<int>());
+	vector<int> dist(n+1, 0);
+	vector<bool> check(n+1, false);
+	queue<int> q;
+
+	for (auto i = edge.begin(); i != edge.end(); i++) {		// 1-2, 2-1 두 개로 저장
+		graph[(*i).front()].push_back((*i).back());
+		graph[(*i).back()].push_back((*i).front());
+	}
+
+	q.push(1);
+	check[1] = true;
+	dist[1] = 0;
+
+	while (!q.empty()) {
+		int start = q.front(); 
+		q.pop();
+		for (auto i : graph[start]) {
+			if (check[i]==false) {
+				check[i] = true;
+				dist[i] = dist[start] + 1;
+				q.push(i);
+			}
+		}
+	}
+
+	sort(dist.begin(), dist.end());
+	inf = dist.back();
+
+	for (int i = 1; i <= n;  i++) {
+		if (dist[i] == inf)
+			answer++;
+	}
+	return answer;
+}
+

Programmers/Programmers.vcxproj

@@ -94,6 +94,7 @@
     <ClCompile Include="Lv2\Lv2_피보나치수.cpp" />
     <ClCompile Include="Lv2\Lv2_행렬의곱셈.cpp" />
     <ClCompile Include="Lv3\Lv3_2xn타일링.cpp" />
+    <ClCompile Include="Lv3\Lv3_가장먼노드.cpp" />
     <ClCompile Include="Lv3\Lv3_네트워크.cpp" />
     <ClCompile Include="Lv3\Lv3_단속카메라.cpp" />
     <ClCompile Include="Lv3\Lv3_단어변환.cpp" />

Programmers/Programmers.vcxproj.filters

@@ -294,5 +294,8 @@
     <ClCompile Include="실전모의고사2회\Q3.cpp">
       <Filter>소스 파일</Filter>
     </ClCompile>
+    <ClCompile Include="Lv3\Lv3_가장먼노드.cpp">
+      <Filter>소스 파일</Filter>
+    </ClCompile>
   </ItemGroup>
 </Project>