Regina Calculation Engine
Static Public Member Functions | List of all members
regina::ExampleLink Class Reference

This class offers routines for constructing ready-made examples of knots and links. More...

#include <link/examplelink.h>

Static Public Member Functions

static Linkunknot ()
 Returns a zero-crossing diagram of the unknot. More...
 
static Linkmonster ()
 Returns the monster unknot, a 10-crossing diagram of the unknot that is difficult to untangle. More...
 
static Linkgordian ()
 Returns Haken's Gordian unknot, a 141-crossing diagram of the unknot that is difficult to untangle. More...
 
static LinktrefoilLeft ()
 Returns a three-crossing diagram of the left-hand trefoil. More...
 
static LinktrefoilRight ()
 Returns a three-crossing diagram of the right-hand trefoil. More...
 
static Linktrefoil ()
 Returns a three-crossing diagram of the right-hand trefoil. More...
 
static LinkfigureEight ()
 Returns a four-crossing diagram of the figure eight knot. More...
 
static Linkhopf ()
 Returns a two-crossing diagram of the Hopf link. More...
 
static Linkwhitehead ()
 Returns a five-crossing diagram of the Whitehead link. More...
 
static Linkborromean ()
 Returns a six-crossing diagram of the Borromean rings. More...
 
static Linkconway ()
 Returns the 11-crossing Conway knot. More...
 
static LinkkinoshitaTerasaka ()
 Returns the 11-crossing Kinoshita-Terasaka knot. More...
 
static Linktorus (int p, int q)
 Returns the (p,q) torus link. More...
 
static Linkgst ()
 Returns a 48-crossing potential counterexample to the slice-ribbon conjecture, as described by Gompf, Scharlemann and Thompson. More...
 

Detailed Description

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.


The documentation for this class was generated from the following file:

Copyright © 1999-2021, The Regina development team
This software is released under the GNU General Public License, with some additional permissions; see the source code for details.
For further information, or to submit a bug or other problem, please contact Ben Burton (bab@maths.uq.edu.au).