Graph.py

#!/usr/bin/env python3

graph = {
    "A": ["B", "C"],
    "B": ["C", "D"],
    "C": ["D"],
    "D": ["C"],
    "E": ["F"],
    "F": ["C"],
}


def find_all_paths(start, end, path=[]):
    path = path + [start]
    if start == end:
        return [path]

    paths = []
    for node in graph[start]:
        if node not in path:
            newpaths = find_all_paths(node, end, path)
            for newpath in newpaths:
                paths.append(newpath)

    return paths


def shortest_path(all_paths):
    return sorted(all_paths, key=len)[0]


def main():
    avail_paths = find_all_paths("A", "C")
    shrt_path = shortest_path(avail_paths[:])

    print("All available Paths are: \n", avail_paths)
    print("\nThe Shortest path is: \n", shrt_path)


if __name__ == "__main__":
    try:
        main()
    except KeyboardInterrupt:
        print("Closing program...")