naming#

Utilities for generating unique node names for planar diagrams.

If a diagram uses alphabetic node names (a–z, A–Z, aa, ab, …), the next names follow that alphabetic sequence. If the diagram uses integer node names, the next names are the next integers.

Functions

`generate_node_names`(number_of_nodes)	Generate number_of_nodes alphabetic node names (a, b, ..., Z, aa, ab, ...).
`multiple_unique_new_node_names`(k, count)	Return count fresh node names for the diagram.
`number_to_alpha`(n)	Convert an integer to its alphabetic name (0 -> 'a', 51 -> 'Z', 52 -> 'aa', ...).
`unique_new_node_name`(k)	Return the next available node name for the diagram.

unique_new_node_name(k)#

Return the next available node name for the diagram.

Parameters:: k (PlanarDiagram | OrientedPlanarDiagram)
Return type:: str | int

multiple_unique_new_node_names(k, count)#

Return count fresh node names for the diagram.

Parameters:

k (PlanarDiagram | OrientedPlanarDiagram)
count (int)

Return type:

list[str] | list[int]

generate_node_names(number_of_nodes)#

Generate number_of_nodes alphabetic node names (a, b, …, Z, aa, ab, …).

Parameters:: number_of_nodes (int)
Return type:: list[str]