def recall_closest(entity, partitioned_entity):
    """ Compute a spanning tree by always taking the closest mention in the same
    entity.

    Args:
        entity (EntityGraph): The EntityGraph for the entity for which the
            spanning tree should be computed.
        partitioned_entity (EntityGraph): A partition of the entity -- not
            used for this algorithm.

    Returns:
        list(Mention, Mention): A list of mention pairs, which constitute the
        edges of the spanning tree. For a pair (m, n), n appears later in
        the text than m.
    """
    edges = []
    for mention in entity.edges:
        if entity.edges[mention]:
            if mention in partitioned_entity.edges:
                antecedent = sorted(partitioned_entity.edges[mention],
                    reverse=True)[0]
            else:
                antecedent = sorted(entity.edges[mention], reverse=True)[0]
            edges.append((mention, antecedent))
    return sorted(edges)
