Skip to content

Instantly share code, notes, and snippets.

View HiBixby's full-sized avatar
♻️
Refactoring

김예지(Yeji Kim) HiBixby

♻️
Refactoring
View GitHub Profile
🌞 Morning 144 commits ███▏░░░░░░░░░░░░░░░░░ 15.2%
🌆 Daytime 143 commits ███▏░░░░░░░░░░░░░░░░░ 15.1%
🌃 Evening 335 commits ███████▍░░░░░░░░░░░░░ 35.3%
🌙 Night 326 commits ███████▏░░░░░░░░░░░░░ 34.4%
@HiBixby
HiBixby / BF.py
Created July 27, 2022 07:20
벨만포드 알고리즘
import sys
input = sys.stdin.readline
INF = int(1e9) # 무한을 의미하는 값으로 10억을 설정
def bf(start):
# 시작 노드에 대해서 초기화
dist[start] = 0
# 전체 n번의 라운드(round)를 반복
for i in range(n):
@HiBixby
HiBixby / BFS.py
Last active July 22, 2022 13:59
[Python] Basic BFS Code
from collections import deque
def bfs(graph, start, visited):
queue = deque([start])
visited[start] = True
while queue:
v = queue.popleft()
print(v, end='')