algorithms

Modules

alternating	Algorithms for detecting whether a planar diagram is alternating.
attributes	Utilities for clearing attributes on diagrams (node, endpoint, and diagram-level attributes).
canonical(k)	Compute the canonical form of an unoriented planar diagram.
closure(k[, over, under])	Close a knotoid by routing through the dual graph between its two degree-1 vertices.
components_link	Link components represent distinct closed loops in a link diagram.
connected_sum(a, b[, arcs])
contract	Contracting an arc in a planar diagram.
cut_set	This module provides tools for identifying and analyzing (arc) cut sets in planar diagrams.
cycles(g, n)	Return all simple cycles of length n in the diagram.
degree_sequence(k)	Return the sorted degree sequence of all nodes.
disjoint_union(*knots[, return_relabel_dicts])	Disjoint sum of multiple diagrams (all of the same type).
duality	"Create a dual graph of a planar diagram.
insert	Insert and modify arcs/endpoints in a planar diagram.
join	Join diagrams by a bridge or by introducing a crossing.
naming	Utilities for generating unique node names for planar diagrams.
orientation	Algorithms that deal with orientation.
remove	Utilities for removing structure from planar diagrams: - empty nodes - a specific arc - all loops - unknots - bivalent (degree-2) vertices
rewire
sanity	Check if the diagram makes sense (is planar, consistent, etc.).
subdivide
symmetry	Symmetry operations on planar knot diagrams.
tangle
tests
topology