Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[최단경로] 2176300 이지현 #349

Open
wants to merge 3 commits into
base: 2176300-이지현2
Choose a base branch
from

Conversation

j2hyeon
Copy link

@j2hyeon j2hyeon commented May 30, 2023

인적사항

학번: 2176300
이름: 이지현


과제 제출

기존 제출 : 1238, 2458
추가 제출 :


@Dong-droid
Copy link
Contributor

Dong-droid commented May 30, 2023

코드리뷰완료
수고하셨습니다 😸 💯 이라서 리뷰할게 없었어요!~ 🥇

Comment on lines +63 to +64
vector<int> go = dijkstra(x, n, rev_graph); // 모든 정점에서 x로 가는 최단 경로
vector<int> back = dijkstra(x, n, graph); // x에서 모든 정점까지 가는 최단 경로
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍 👍

Comment on lines +53 to +65
for (int i = 1; i <= n; i++)
{
int cnt = 0;
for (int j = 1; j <= n; j++)
{
if (h[i][j] != INF || h[j][i] != INF)
{ // i번, j번 학생 키의 대소관계를 아는 경우
cnt++;
}
}
if (cnt == n - 1) // 자기를 제외한 모든 사람과의 비교가 완료된 경우
ans++; // ans ++
}
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍 👍 💯

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants