Function construct_path

graphs/bidirectional_search.py:41–46

(current: int | None, parents: dict[int, int | None])

def construct_path(current: int | None, parents: dict[int, int | None]) -> list[int]:
    path: list[int] = []
    while current is not None:
        path.append(current)
        current = parents[current]
    return path


def bidirectional_search(