[20251123] BOJ / G4 / 이분 그래프 / 설진영 #1491
Merged
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
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.
🧷 문제 링크
https://www.acmicpc.net/problem/1707
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
그래프가 이분 그래프인지 판별하는 문제
이분 그래프는 정점을 두 그룹으로 나눴을 때, 같은 그룹 내의 정점끼리는 인접하지 않는 그래프를 의미
🔍 풀이 방법
BFS를 이용한 그래프 색칠
각 정점을 1 또는 -1로 색칠하며 탐색
-> 인접한 정점은 반대 색, 정점이 같은 색이면 이분 그래프가 아님
⏳ 회고
쉽다