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

[23-02-07] seungyeon.py #68

Merged
merged 1 commit into from
Feb 7, 2023
Merged

[23-02-07] seungyeon.py #68

merged 1 commit into from
Feb 7, 2023

Conversation

seungueonn
Copy link
Collaborator

@seungueonn seungueonn commented Feb 6, 2023 •
edited
Loading

PR Summary

가장 먼 노드

  • 제가 좋아하는 bfs 입니다.
  • bfs(또는 dfs)는 "최소" , "가장빠른" 이라는 단어가 나오면 사용하면 좋다고 들었습니다.
  • 가중치가 적용되지 않을 때, BFS의 부가 효과를 이용한다면, 최소 이동 횟수도 계산 가능

ISSUE NUMBER

@seungueonn seungueonn changed the title Create [그래프] 가장 먼 노드 seungyeon.py [23-02-07] seungyeon.py Feb 6, 2023
@seungueonn seungueonn self-assigned this Feb 6, 2023
@seungueonn seungueonn merged commit 0f2c6d7 into da-in:main Feb 7, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers

@da-in da-in Awaiting requested review from da-in da-in is a code owner

@Lee-DoHa Lee-DoHa Awaiting requested review from Lee-DoHa

@lalabulla lalabulla Awaiting requested review from lalabulla lalabulla is a code owner

@chs98412 chs98412 Awaiting requested review from chs98412 chs98412 is a code owner

Assignees

@seungueonn seungueonn

Labels
dfs/bfs
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
1 participant
@seungueonn