We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent c41f9c1 commit 5bbee8cCopy full SHA for 5bbee8c
10/9.cpp
@@ -35,7 +35,7 @@ void topologySort() {
35
result.push_back(now);
36
// 해당 원소와 연결된 노드들의 진입차수에서 1 빼기
37
for (int i = 0; i < graph[now].size(); i++) {
38
- result[graph[now][i]] = max(result[graph[now][i]], result[now] + times[graph[now][i]]);
+ result[graph[now][i]] = max(result[graph[now][i]], result[now] + times[graph[now][i]]);
39
indegree[graph[now][i]] -= 1;
40
// 새롭게 진입차수가 0이 되는 노드를 큐에 삽입
41
if (indegree[graph[now][i]] == 0) {
@@ -69,4 +69,4 @@ int main(void) {
69
}
70
71
topologySort();
72
-}
+}
0 commit comments