triangulate_embedding(embedding, fully_triangulate=True)
Traverses faces of the embedding and adds edges to a copy of the embedding to triangulate it. The method also ensures that the resulting graph is 2-connected by adding edges if the same vertex is contained twice on a path around a face.
The input graph must contain at least 3 nodes.
If set to False the face with the most nodes is chooses as outer face. This outer face does not get triangulated.
The element :None:None:`embedding` is a new embedding containing all edges from the input embedding and the additional edges to triangulate the graph. The element :None:None:`outer_face` is a list of nodes that lie on the outer face. If the graph is fully triangulated these are three arbitrary connected nodes.
Triangulates the embedding.
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