[최단 경로] 2171039 이채원 #350
Open
[최단 경로] 2171039 이채원 #350
Conversation
This file contains hidden or 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
Contributor
|
코드리뷰완료 |
Dong-droid
reviewed
May 30, 2023
13_최단 경로/필수/BOJ_1238.cpp
Outdated
Comment on lines
+50
to
+63
Dong-droid
reviewed
May 30, 2023
13_최단 경로/필수/BOJ_2458.cpp
Outdated
Comment on lines
+24
to
+36
Contributor
There was a problem hiding this comment.
P3. queue를 사용해도 되지만
for(int i = 1; i <=n; i++)
if(graph[node][i] == INF && graph[i][node] == INF) return false;
를 사용해서 for문으로도 구현할 수 있습니다~
jk0527
reviewed
Jun 2, 2023
Contributor
jk0527
left a comment
jk0527
left a comment
There was a problem hiding this comment.
[최단 경로 구현 문제 추가 제출 확인 완료]
추가 제출 확인했습니다!🥰🥰
수고하셨습니다!
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
3 participants
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.
인적사항
학번: 2171039
이름: 이채원
과제 제출
기존 제출 : 1238, 2458
추가 제출 : 15685