Bug Fix for https://stackabuse.com/depth-first-search-dfs-in-python-theory-and-implementation/

dfs.py

def dfs(adj_list, start, target, path, visited=set()):
    path.append(start)
    visited.add(start)
    if start == target:
        return path
    for neighbour in adj_list[start]:
        if neighbour not in visited:
            result = dfs(adj_list, neighbour, target, path, visited)
            if result is not None:
                return result
    path.pop()   // <-- indentation matters
      //path.pop()
    return None