Tree.hpp

Go to the documentation of this file.

#ifndef TREE_HPP
#define TREE_HPP

#include <vector>
#include <string>

struct Edge
{
        unsigned int u;
        unsigned int v;
};

class Tree
{
        public:
                Tree();

                Tree( unsigned int order, int *levelSequence );

                Tree( const Tree & that );

                ~Tree();

                unsigned int getOrder() const { return mOrder; };
                unsigned int getDegree( unsigned int v ) const { if( v < mOrder ) return mDegrees[v]; return 0; };

                std::vector<Edge> getEdges() const;
                void getDegreeSequence( std::vector<unsigned int> & degreeSequence ) const;
                void getPathNums( std::vector<unsigned int> & pathNums ) const;

                void print() const;

                Tree & operator=( const Tree & rhs );
        
        private:
                void pathNumsDfs( unsigned int i, unsigned int count, bool *& visited, std::vector<unsigned int> & pathNums ) const;

                unsigned int    mOrder;         //< Number of vertices in the tree.
                unsigned int    *mDegrees;      //< Degrees of each vertex, from vertex 0 to mOrder - 1.
                unsigned int    *mOffsets;      //< Offsets to the location of the adjacency lists in mAdjArray.
                unsigned int    *mAdjArray;     //< Array containing adjacency lists.
};

#endif

---