DataStructures::Tree< TreeType > Class Template Reference

#include <DS_Tree.h>

Inheritance diagram for DataStructures::Tree< TreeType >:

List of all members.

Public Member Functions
void	AddChild (TreeType &newData)
void	DeleteDecendants (void)
void	LevelOrderTraversal (DataStructures::List< Tree * > &output)
	Tree (TreeType &inputData)
	Tree ()
	~Tree ()
Public Attributes
DataStructures::List< Tree * >	children
TreeType	data

---

Detailed Description

template<class TreeType>
class DataStructures::Tree< TreeType >

Definition at line 23 of file DS_Tree.h.

---

Constructor & Destructor Documentation

template<class TreeType >

DataStructures::Tree< TreeType >::Tree

(

)

Definition at line 38 of file DS_Tree.h.

    {

    }

template<class TreeType>

DataStructures::Tree< TreeType >::Tree

(

TreeType &

inputData

)

Definition at line 44 of file DS_Tree.h.

    {
        data=inputData;
    }

template<class TreeType >

DataStructures::Tree< TreeType >::~Tree

(

)

Definition at line 50 of file DS_Tree.h.

    {
        DeleteDecendants();
    }

---

Member Function Documentation

template<class TreeType>

void DataStructures::Tree< TreeType >::AddChild

(

TreeType &

newData

)

Definition at line 75 of file DS_Tree.h.

References _FILE_AND_LINE_.

    {
        children.Insert(RakNet::OP_NEW<Tree>(newData, _FILE_AND_LINE_));
    }

template<class TreeType >

void DataStructures::Tree< TreeType >::DeleteDecendants

(

void

)

Definition at line 81 of file DS_Tree.h.

References _FILE_AND_LINE_, and RakNet::OP_DELETE().

Referenced by DataStructures::WeightedGraph< node_type, weight_type, allow_unlinkedNodes >::GetSpanningTree().

    {
        /*
        DataStructures::List<Tree*> output;
        LevelOrderTraversal(output);
        unsigned i;
        for (i=0; i < output.Size(); i++)
            RakNet::OP_DELETE(output[i], _FILE_AND_LINE_);
*/

        // Already recursive to do this
        unsigned int i;
        for (i=0; i < children.Size(); i++)
            RakNet::OP_DELETE(children[i], _FILE_AND_LINE_);
    }

template<class TreeType >

void DataStructures::Tree< TreeType >::LevelOrderTraversal

(

DataStructures::List< Tree< TreeType > * > &

output

)

Definition at line 56 of file DS_Tree.h.

References _FILE_AND_LINE_, DataStructures::Tree< TreeType >::children, DataStructures::List< list_type >::Insert(), DataStructures::Queue< queue_type >::Pop(), DataStructures::Queue< queue_type >::Push(), DataStructures::List< list_type >::Size(), and DataStructures::Queue< queue_type >::Size().

    {
        unsigned i;
        Tree<TreeType> *node;
        DataStructures::Queue<Tree<TreeType>*> queue;

        for (i=0; i < children.Size(); i++)
            queue.Push(children[i]);

        while (queue.Size())
        {
            node=queue.Pop();
            output.Insert(node, _FILE_AND_LINE_);
            for (i=0; i < node->children.Size(); i++)
                queue.Push(node->children[i]);
        }
    }

---

Member Data Documentation

template<class TreeType>

DataStructures::List<Tree *> DataStructures::Tree< TreeType >::children

Definition at line 34 of file DS_Tree.h.

Referenced by DataStructures::WeightedGraph< node_type, weight_type, allow_unlinkedNodes >::GetSpanningTree(), and DataStructures::Tree< TreeType >::LevelOrderTraversal().

template<class TreeType>

TreeType DataStructures::Tree< TreeType >::data

Definition at line 33 of file DS_Tree.h.

Referenced by DataStructures::WeightedGraph< node_type, weight_type, allow_unlinkedNodes >::GetSpanningTree().

---

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

• DS_Tree.h