13 shortest path #13
Open
13 shortest path #13
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
…Altu-Bitu-HwangJaeEun into 06_greedy_algorithm
Dong-droid
reviewed
Nov 29, 2023
Comment on lines
+21
to
+35
| int findAnswer(int n, vector<vector<int>> &graph) { | ||
| int answer = 0; | ||
| for (int i = 1; i <= n; ++i) { | ||
| int cnt = 0; | ||
| for (int j = 1; j <= n; ++j) { | ||
| if (i != j && (graph[i][j] != INF || graph[j][i] != INF)) { | ||
| cnt++; | ||
| } | ||
| } | ||
| if (cnt == n - 1) { | ||
| answer++; | ||
| } | ||
| } | ||
| return answer; | ||
| } |
Dong-droid
reviewed
Nov 29, 2023
| while(M--) { | ||
| int a, b; | ||
| cin >> a >> b; | ||
| graph[a][b] = 1; // a가 b보다 작음을 나타내는 정보 |
There was a problem hiding this comment.
P3. graph를 boolean 타입으로 해도 괜찮을 것 같습니다.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
인적 사항
학번 : 2176427
이름 : 황재은
과제 제출
기존 제출 : 2458, 15685
추가 제출 : 1238