Vanilla graph depth first search implementation in Python

depth_first_search.py

def dfs(g, curr_node, visited=None):
    """
    
    Parameters
    ----------
    graph: dictionary
        dictionary of nodes and its neighbors
    node: list
    
    Returns
    -------
    visited: set
        a set of visited graph nodes
        
    Algo: add current node to the list of visited
    
    """
    if visited is None:
        visited = set()
    visited.add(curr_node)
    print("added %d" % curr_node)
    
    for neigh_node in g[curr_node]:
        if neigh_node not in visited:
            dfs(g, neigh_node, visited)
        
    return visited

g = {0:[8, 1, 3, 4], 1:[0,2, 5], 2:[1, 3], 3:[4], 4:[0], 5:[1], 8:[0]}
dfs(g, curr_node=0)