Finding all paths in graph, Python

Question

I have a graph, represented in a way of a dictionary with pairs key|value - A node|Edges to other nodes . Example:

{'5': '1 2 3 W', '0': '1 2 3 W', '2': '0 4 5 L', '1': '0 4 5 L', '4': '1 2 3 W', '3': '0 4 5 L'}

( W and L are the marks of the nodes)
What is the best approach to find all the paths WLWL or LWLW ? (Python 3.+)

Answer 1

A "breadth first search" algorithm may be what you are looking for. You can find a good explanation and a Python implementation here .