connections.py

def explore(l, c, t): # l = 2d list of connections; c = current node; t = target node
    if c == t:  # base case
        return [[c]]
    else:  # recursive case
        conns = []
            if c in i:
                conns.extend([[c] + conn
                              for conn in explore([k for k in l if i != k],
                                                  (i[0] if c == i[1] else i[1]),
                                                  t)
                              if c not in conn])
        return conns
    

conns = [('a', 'b'), ('b', 'c'), ('d', 'e'), ('c', 'd'), ('d', 'b'), ('a', 'd')]
target = 'e'
start = 'a'

print(explore(conns, start, target))

output.txt

[['a', 'b', 'c', 'd', 'e'], ['a', 'b', 'd', 'e'], ['a', 'd', 'e']]