Update 4.cpp

ndb796 · web-flow · commit 2d1423f96150 · 2020-11-02T15:48:56.000+09:00
diff --git a/21/4.cpp b/21/4.cpp
@@ -46,7 +46,7 @@ int main(void) {
     // &#52572;&#45800; &#44144;&#47532; &#53580;&#51060;&#48660;&#51012; &#47784;&#46160; &#47924;&#54620;&#51004;&#47196; &#52488;&#44592;&#54868;
     fill_n(d, 501, INF);
     
-    // &#45796;&#51061;&#49828;&#53944;&#46972; &#50508;&#44256;&#47532;&#51608;&#51012; &#49688;&#54665;
+    // &#48296;&#47564; &#54252;&#46300; &#50508;&#44256;&#47532;&#51608;&#51012; &#49688;&#54665;
     bool negative_cycle = bf(1); // 1&#48264; &#45432;&#46300;&#44032; &#49884;&#51089; &#45432;&#46300;
 
     if (negative_cycle) {

-Original file line number
+Diff line change
     // 최단 거리 테이블을 모두 무한으로 초기화
     fill_n(d, 501, INF);
 -    // 다익스트라 알고리즘을 수행
 +    // 벨만 포드 알고리즘을 수행
     bool negative_cycle = bf(1); // 1번 노드가 시작 노드
     if (negative_cycle) {