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.

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

programmers: 62050 #57

Open
wants to merge 4 commits into
base: master
Choose a base branch
from
Open

programmers: 62050 #57

wants to merge 4 commits into from

Conversation

mu-hun
Copy link
Owner

@mu-hun mu-hun commented Jun 15, 2020

@mu-hun
programmers(WIP): 62050
315c695 
플러드 필 + 최소 신장 트리 문제

최소 신장 트리 검색 구현체를 대강 DFS 로 쟉성해봤으나 기댓값과 다릅니다.
크루스칼/프림 중에 하나 이상을 이해해서 통과시켜 봅시다.
@mu-hun
Implement MST search with prim's algorithm
9ea8582 
가중치가 가장 작은 간선을 연속적으로 선택하는 방법을 생각해봤으나 첫번째 테스트 케이스에 대해 유효하지 않는 방법입니다.

나중에 크루스칼 + 유니온 파인드로 구현해보자
@mu-hun
Implement matrix to edge list
236b50a
@mu-hun
Implement answer with Union-Find
9c5f281 
첫번째 테스트 케이스의 기댓값이 15인데 23이 나왔다.
@mu-hun mu-hun mentioned this pull request Jun 27, 2020
Open
24 tasks
@mu-hun mu-hun added the help wanted Extra attention is needed label Mar 20, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers
No reviews
Assignees
No one assigned
Labels
help wanted Extra attention is needed
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
1 participant
@mu-hun