BraidNode Struct Reference

Defines a crossing in a linked braid structure//. More...

#include <LinkedBraidStructure.h>

List of all members.

Public Member Functions

 BraidNode (int num=0, bool tp=true, BraidNode *l=NULL, BraidNode *a=NULL, BraidNode *r=NULL, BraidNode *bl=NULL, BraidNode *b=NULL, BraidNode *br=NULL)
 BraidNode (bool m=false)
 Default constructor (creates a disconnected node - all pointers are NULL).

Static Public Member Functions

static bool isHandle (vector< BraidNode * > &backNodes, int g)
static void removeHandle (vector< BraidNode * > &frontNodes, vector< BraidNode * > &backNodes, int g, list< int > &processedHandle)
static void removeNodeTerminalClosure (vector< BraidNode * > &frontNodes, vector< BraidNode * > &backNodes, int g, BraidNode *node, list< int > &removedClosure)
static void removeTerminalNode (vector< BraidNode * > &frontNodes, vector< BraidNode * > &backNodes, int g, BraidNode *node, list< int > &removedClosure)

Public Attributes

BraidNode * left
BraidNode * ahead
BraidNode * right
BraidNode * back_left
BraidNode * back
BraidNode * back_right
bool type
 crossing orientation (true=positive, false=negative)
BraidNode * link
int weight
int theNumber
BraidNode * left
 pointer to the ahead-left node
BraidNode * ahead
 pointer to the ahead node
BraidNode * right
 pointer to the ahead-right node
BraidNode * back_left
 pointer to the back-left node
BraidNode * back
 pointer to the back node
BraidNode * back_right
 pointer to the back-right node
bool marked
 Auxiliary flag. Used in LinkedBraidStructure::getWord( ) to mark used crossings.

Detailed Description

Defines a crossing in a linked braid structure//.

Represented by the orientation (type) of the crossing and 6 pointers to other crossings

Definition at line 20 of file LinkedBraidStructure.h.

Constructor & Destructor Documentation

BraidNode::BraidNode (  int  num = 0,
bool  tp = true,
BraidNode *  l = NULL,
BraidNode *  a = NULL,
BraidNode *  r = NULL,
BraidNode *  bl = NULL,
BraidNode *  b = NULL,
BraidNode *  br = NULL
)  [inline]
 

Definition at line 31 of file LinkedBraidStructure.h.

BraidNode::BraidNode (  bool  m = false  )  [inline]
 

Default constructor (creates a disconnected node - all pointers are NULL).

Definition at line 36 of file LinkedBraidStructure_old.h.

Member Function Documentation

static bool BraidNode::isHandle (  vector< BraidNode * > &  backNodes,
int  g
)  [static]
 

static void BraidNode::removeHandle (  vector< BraidNode * > &  frontNodes,
vector< BraidNode * > &  backNodes,
int  g,
list< int > &  processedHandle
)  [static]
 

static void BraidNode::removeNodeTerminalClosure (  vector< BraidNode * > &  frontNodes,
vector< BraidNode * > &  backNodes,
int  g,
BraidNode *  node,
list< int > &  removedClosure
)  [static]
 

static void BraidNode::removeTerminalNode (  vector< BraidNode * > &  frontNodes,
vector< BraidNode * > &  backNodes,
int  g,
BraidNode *  node,
list< int > &  removedClosure
)  [static]
 

Member Data Documentation

BraidNode* BraidNode::ahead
 

pointer to the ahead node

if $w = w_1 \circ x_i \circ w_2$ and the node corresponds to $x_i$ then ahead points to the rightmost $x_{i}$ in $w_1$.

Definition at line 53 of file LinkedBraidStructure_old.h.

BraidNode* BraidNode::ahead
 

Definition at line 46 of file LinkedBraidStructure.h.

BraidNode* BraidNode::back
 

pointer to the back node

if $w = w_1 \circ x_i \circ w_2$ and the node corresponds to $x_i$ then ahead points to the leftmost $x_{i}$ in $w_2$.

Definition at line 78 of file LinkedBraidStructure_old.h.

BraidNode* BraidNode::back
 

Definition at line 50 of file LinkedBraidStructure.h.

BraidNode* BraidNode::back_left
 

pointer to the back-left node

if $w = w_1 \circ x_i \circ w_2$ and the node corresponds to $x_i$ then back_left points to the leftmost $x_{i-1}$ in $w_2$. Except one case! If between $x_{i}$ and $x_{i-1}$ there is another $x_{i}$ then back_left = NULL.

Definition at line 71 of file LinkedBraidStructure_old.h.

BraidNode* BraidNode::back_left
 

Definition at line 49 of file LinkedBraidStructure.h.

BraidNode* BraidNode::back_right
 

pointer to the back-right node

if $w = w_1 \circ x_i \circ w_2$ and the node corresponds to $x_i$ then back_right points to the leftmost $x_{i+1}$ in $w_2$. Except one case! If between $x_{i}$ and $x_{i+1}$ there is another $x_{i}$ then back_right = NULL.

Definition at line 87 of file LinkedBraidStructure_old.h.

BraidNode* BraidNode::back_right
 

Definition at line 51 of file LinkedBraidStructure.h.

BraidNode* BraidNode::left
 

pointer to the ahead-left node

if $w = w_1 \circ x_i \circ w_2$ and the node corresponds to $x_i$ then left points to the rightmost $x_{i-1}$ in $w_1$. Except one case! If between $x_{i-1}$ and $x_{i}$ there is another $x_{i}$ then left = NULL.

Definition at line 46 of file LinkedBraidStructure_old.h.

BraidNode* BraidNode::left
 

Definition at line 45 of file LinkedBraidStructure.h.

BraidNode* BraidNode::link [mutable]
 

Definition at line 56 of file LinkedBraidStructure.h.

bool BraidNode::marked [mutable]
 

Auxiliary flag. Used in LinkedBraidStructure::getWord( ) to mark used crossings.

Definition at line 108 of file LinkedBraidStructure_old.h.

BraidNode* BraidNode::right
 

pointer to the ahead-right node

if $w = w_1 \circ x_i \circ w_2$ and the node corresponds to $x_i$ then right points to the rightmost $x_{i+1}$ in $w_1$. Except one case! If between $x_{i+1}$ and $x_{i}$ there is another $x_{i}$ then right = NULL.

Definition at line 62 of file LinkedBraidStructure_old.h.

BraidNode* BraidNode::right
 

Definition at line 47 of file LinkedBraidStructure.h.

int BraidNode::theNumber
 

Definition at line 62 of file LinkedBraidStructure.h.

bool BraidNode::type
 

crossing orientation (true=positive, false=negative)

Definition at line 53 of file LinkedBraidStructure.h.

int BraidNode::weight [mutable]
 

Definition at line 59 of file LinkedBraidStructure.h.

The documentation for this struct was generated from the following files:
Generated on Sun Dec 3 10:58:58 2006 for CRyptography And Groups (CRAG) by  doxygen 1.4.6