Regina Calculation Engine
|
This class offers routines for constructing ready-made examples of knots and links. More...
#include <link/examplelink.h>
Static Public Member Functions | |
static Link * | unknot () |
Returns a zero-crossing diagram of the unknot. More... | |
static Link * | monster () |
Returns the monster unknot, a 10-crossing diagram of the unknot that is difficult to untangle. More... | |
static Link * | gordian () |
Returns Haken's Gordian unknot, a 141-crossing diagram of the unknot that is difficult to untangle. More... | |
static Link * | trefoilLeft () |
Returns a three-crossing diagram of the left-hand trefoil. More... | |
static Link * | trefoilRight () |
Returns a three-crossing diagram of the right-hand trefoil. More... | |
static Link * | trefoil () |
Returns a three-crossing diagram of the right-hand trefoil. More... | |
static Link * | figureEight () |
Returns a four-crossing diagram of the figure eight knot. More... | |
static Link * | hopf () |
Returns a two-crossing diagram of the Hopf link. More... | |
static Link * | whitehead () |
Returns a five-crossing diagram of the Whitehead link. More... | |
static Link * | borromean () |
Returns a six-crossing diagram of the Borromean rings. More... | |
static Link * | conway () |
Returns the 11-crossing Conway knot. More... | |
static Link * | kinoshitaTerasaka () |
Returns the 11-crossing Kinoshita-Terasaka knot. More... | |
static Link * | torus (int p, int q) |
Returns the (p,q) torus link. More... | |
static Link * | gst () |
Returns a 48-crossing potential counterexample to the slice-ribbon conjecture, as described by Gompf, Scharlemann and Thompson. More... | |
This class offers routines for constructing ready-made examples of knots and links.
These examples may be useful for testing new code, or for simply getting a feel for how Regina works.
The sample links offered here may prove especially useful in Regina's scripting interface, where working with pre-existing files is more complicated than in the GUI.
All of the methods in this class will assign an appropriate packet label to the link that they return.
Note that each of these routines constructs a new link from scratch. It is up to the caller of each routine to destroy the link that is returned.