components#
Computes various decompositions of knotted objects, namely:
“link components” are connected components of a link, e.g. a knot has 1 link component, the Hopf link has 2 link components and the Borromean Link has 3 link components,
“disjoint components”: are the components that do not share a common node (crossing or vertex),
“connected sum components” are the factors of a composite knot diagram.
“strand” a strand is either a closed component or a path between
Functions
Add unknot to k (in place). |
|
|
Finds all k-cut of a graph. |
|
Return the disjoint sum, k[0] ⊔ k[1] ⊔ . |
Return True if g is a connected sum diagram and False otherwise. |
|
Return True if g is a 3rd order connected sum diagram and False otherwise. |
|
Return a list of sets of endpoints belonging to the same link component. |
|
Return the number of link components. |