def basic_dbfs(graph: dict) -> list[int]:
    """basic_dbfs
    
    A basic breadth first search.

    Args:
        graph (list[tuple[int]]): 
            The graph in below form:
                {1:(2,3,4)}

    Returns:
        list[int]: The visited items
    """
    visited = []
    queue = []
    it1=list(graph)[0]
    visited.append(it1)
    queue.append(it1)
    
    while queue:
        j = queue[0]
        items = graph[j]
        for item in items:
            if item not in visited:
                visited.append(item)
                queue.append(item)
        queue.pop(0)
        
    return visited