def compute_in_degrees(digraph):
    """
    Compute In-Degree Dictionary for the given directed Graph.

    :param digraph: dictionary representation of a directed graph.
    :return: the dictionary representing the in-degree count for each node in
             the graph.
    """

    in_degrees_representation = dict.fromkeys(digraph.keys(), 0)
    for connected_nodes in digraph.itervalues():
        for entry in connected_nodes:
            in_degrees_representation[entry] += 1

    return in_degrees_representation