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

[DataStructure] 그래프 #9

Open

jhw296 opened this issue Oct 28, 2024 · 0 comments

Member

jhw296 commented Oct 28, 2024 •

edited

Loading

Q. 인접 행렬과 인접 리스트의 차이점은 무엇이며, 각 방식의 장단점을 설명하라.

[hint] 구조 / 메모리 사용 방식
[keyword] 인접 행렬 / 인접 리스트 / 메모리 효율성

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