mirror of
https://github.com/onyx-and-iris/grokking-algorithms.git
synced 2024-09-27 19:17:04 +01:00
49 lines
968 B
Python
49 lines
968 B
Python
import logging
|
|
from collections import deque
|
|
from dataclasses import dataclass
|
|
|
|
logging.basicConfig(level=logging.DEBUG)
|
|
logger = logging.getLogger(__name__)
|
|
|
|
|
|
@dataclass
|
|
class Node:
|
|
name: str
|
|
distance: int
|
|
|
|
|
|
graph = {
|
|
"s": [Node("a", 1), Node("b", 1)],
|
|
"a": [Node("c", 0), Node("f", 0)],
|
|
"b": [Node("c", 0), Node("d", 0)],
|
|
"c": [],
|
|
"d": [Node("f", 0)],
|
|
"f": [],
|
|
}
|
|
|
|
visited = []
|
|
|
|
|
|
def bfs():
|
|
queue = deque()
|
|
queue += graph["s"]
|
|
|
|
while queue:
|
|
logger.debug(queue)
|
|
current_node = queue.popleft()
|
|
if current_node.name == "f":
|
|
return current_node.distance
|
|
|
|
if current_node.name in visited:
|
|
continue
|
|
visited.append(current_node.name)
|
|
|
|
next_nodes = graph[current_node.name]
|
|
for node in next_nodes:
|
|
node.distance = current_node.distance + 1
|
|
queue += next_nodes
|
|
|
|
|
|
distance = bfs()
|
|
print(f"shortest distance from s to f: {distance}")
|