def fewest_neighbors(node, neighbors):
    """Return the neighbor of this node with the fewest neighbors."""
    edges = [(n, len(neighbors[n])) for n in neighbors[node]]
    edges.sort(key=lambda n: n[1])
    return edges[0][0]