def get_searched_index(graph, start, nodes_count):
    """
    Returns a dictionary with a key for each node in the graph with an integer
    initialized to the total number of nodes, which is more than the maximum
    number of levels, since we're counting levels from 0, so it can double as
    a bool indicating whether the node has been searched.
    """
    searched = {}
    for k in graph.keys():
        if k == start:
            searched[k] = 0
        else:
            searched[k] = nodes_count
    return searched