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.

Sign up for GitHub

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

Jump to bottom

S 1249 보급로 #3

Open

sanhaa opened this issue Apr 8, 2021 · 0 comments

Labels

imcomplete problem solving

Owner

sanhaa commented Apr 8, 2021

문제 바로가기

최단 거리 알고리즘으로 푸는건데

다익스트라
BFS
완전 탐색 (가지치기 필수)

인접 행렬 A 설계가 어렵다.

sanhaa added imcomplete problem solving labels

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment