LinkedBraidStructure_old.h

Go to the documentation of this file.

// Copyright (C) 2005 Alexander Ushakov
// Contents: Definition of class BraidNode
//
// Principal Authors: Alexander Ushakov
//
// Revision History:
//

#ifndef _LinkedBraidStructure_h_
#define _LinkedBraidStructure_h_


#include "list"
#include "vector"
using namespace std;


//---------------------------------------------------------------------------//
//------------------------------ BraidNode ----------------------------------//
//---------------------------------------------------------------------------//


struct BraidNode
{
  
  // BraidNode( ) : left( 0 ), ahead( 0 ), right( 0 ),
  // back_left( 0 ), back( 0 ), back_right( 0 ) , marked( 0 ) { }
  
  BraidNode( bool m=false ) : left( 0 ), ahead( 0 ), right( 0 ),
                        back_left( 0 ), back( 0 ), back_right( 0 ) , marked( m ) { }
  

  BraidNode* left;
  

  BraidNode* ahead;


  BraidNode* right;


  BraidNode* back_left;


  BraidNode* back;


  BraidNode* back_right;

  // bool ahead_left_order;
  // bool ahead_right_order;
  // shows the order of links ahead (0 - center first, 1 - sides first)
  // bool back_left_order;
  // bool back_right_order;
  // shows the order of links back (0 - center first, 1 - sides first)

  // static void addNode( vector< BraidNode* >& frontNodes , int g );
  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 );

  // static list< int > translateIntoWord( vector< BraidNode* >& frontNodes );

  bool type;
  
  mutable bool marked;
};


//---------------------------------------------------------------------------//
//--------------------------- LinkedBraidStructure --------------------------//
//---------------------------------------------------------------------------//


class LinkedBraidStructure
{
  //                                                     //
  //  Constructors                                       //
  //                                                     //
 public:

  LinkedBraidStructure( int N );
  ~LinkedBraidStructure( );
  
  
  //                                                     //
  //  Accessors:                                         //
  //                                                     //

 public:
  
  void push_back( int i );
  template< class ConstIntIterator >
    void push_back( ConstIntIterator B , ConstIntIterator E ) {
    for( ; B!=E ; ++B )
      push_back( *B );
  }
  
  void clear( );
  void push_front( int i );

  void transformToDehornoyForm( );
  list< int > getWord( ) const;

  //                                                     //
  //  Internal functions:                                //
  //                                                     //
private:

  void processNode( list< int >& result , int index , const BraidNode* bn ) const;

  //                                                     //
  //  Data members                                       //
  //                                                     //
private:

  int theRank;
  // specifies the number of strands (number of generators + 1)
  
  vector< BraidNode* > frontNodes;
  vector< BraidNode* > backNodes;
  
  // Auxiliary variable. Used in getWord to specify the type of the last mark.
  mutable bool theMark;
};


#endif