-
Notifications
You must be signed in to change notification settings - Fork 0
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
[Algorithm] 미로 탐색 #173
Comments
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
💬 문제
https://www.acmicpc.net/problem/2178
💬 첫 Idea
⇒ 그러나 dfs 재귀함수로는 시간초과가 발생했다.
💬 풀이
💬 정답 Idea
💬 정답 풀이
미로 탐색 문제를 풀어보면서 해당 문제처럼 **
경로의 최단 거리를 구하는 문제
**는 BFS로 풀이해야 효율적이라는걸 몸소 체감할 수 있었습니다 😊 !!The text was updated successfully, but these errors were encountered: