algorithms

Modules

canonical(k)	Compute the canonical form of an unoriented planar diagram.
closure(k[, over, under])
components_link	Link components represent distinct closed loops in a link diagram.
connected_sum
cut_set	This module provides tools for identifying and analyzing (arc) cut sets in planar diagrams.
cycles
degree_sequence
disjoint_sum(*knots)	Return the disjoint sum of the given planar diagrams.
duality	" Creates a dual graph of a planar diagram
naming
orientation	Algorithms with orientation.
paths
sanity
skein	Here are implementations of Skein operations.
tests
topology