networkx 2.8.2 Pypi GitHub Homepage
Other Docs
ParametersReturns
combinatorial_embedding_to_pos(embedding, fully_triangulate=False)

The algorithm iteratively inserts nodes of the input graph in a certain order and rearranges previously inserted nodes so that the planar drawing stays valid. This is done efficiently by only maintaining relative positions during the node placements and calculating the absolute positions at the end. For more information see .

Parameters

embedding : nx.PlanarEmbedding

This defines the order of the edges

fully_triangulate : bool

If set to True the algorithm adds edges to a copy of the input embedding and makes it chordal.

Returns

pos : dict

Maps each node to a tuple that defines the (x, y) position

Assigns every node a (x, y) position based on the given embedding

Examples

See :

Local connectivity graph

Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.

Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)

SVG is more flexible but power hungry; and does not scale well to 50 + nodes.

All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them


GitHub : /networkx/algorithms/planar_drawing.py#8
type: <class 'function'>
Commit: