def _create_label(self, kg: KG, vertex: Vertex, n: int) -> str:
    'Creates a label according to a vertex and its neighbors.\n\n        kg: The Knowledge Graph.\n\n            The graph from which the neighborhoods are extracted for the\n            provided entities.\n        vertex: The vertex to get its neighbors to create the suffix.\n        n:  The index of the neighbor\n\n        Returns:\n            the label created for the vertex.\n\n        '
    if (len(self._label_map) == 0):
        self._weisfeiler_lehman(kg)
    suffix = '-'.join(sorted(set([self._label_map[neighbor][(n - 1)] for neighbor in kg.get_neighbors(vertex, is_reverse=True)])))
    return f'{self._label_map[vertex][(n - 1)]}-{suffix}'
Creates a label according to a vertex and its neighbors.

kg: The Knowledge Graph.

    The graph from which the neighborhoods are extracted for the
    provided entities.
vertex: The vertex to get its neighbors to create the suffix.
n:  The index of the neighbor

Returns:
    the label created for the vertex.
def _create_label(self, kg: KG, vertex: Vertex, n: int) -> str:
    'Creates a label according to a vertex and its neighbors.\n\n        kg: The Knowledge Graph.\n\n            The graph from which the neighborhoods are extracted for the\n            provided entities.\n        vertex: The vertex to get its neighbors to create the suffix.\n        n:  The index of the neighbor\n\n        Returns:\n            the label created for the vertex.\n\n        '
    if (len(self._label_map) == 0):
        self._weisfeiler_lehman(kg)
    suffix = '-'.join(sorted(set([self._label_map[neighbor][(n - 1)] for neighbor in kg.get_neighbors(vertex, is_reverse=True)])))
    return f'{self._label_map[vertex][(n - 1)]}-{suffix}'