dai::RootedTree Class Reference

Represents a rooted tree, implemented as a vector of directed edges. More...

#include <dai/weightedgraph.h>

Inherits std::vector< T >.

List of all members.

Public Member Functions

 RootedTree ()
 Default constructor.
 RootedTree (const GraphEL &T, size_t Root)
 Constructs a rooted tree from a tree and a root.


Detailed Description

Represents a rooted tree, implemented as a vector of directed edges.

By convention, the edges are stored such that they point away from the root and such that edges nearer to the root come before edges farther away from the root.


Constructor & Destructor Documentation

dai::RootedTree::RootedTree (  )  [inline]

Default constructor.

dai::RootedTree::RootedTree ( const GraphEL T,
size_t  Root 
)

Constructs a rooted tree from a tree and a root.

Precondition:
T has no cycles and contains node Root


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

Generated on Thu Aug 5 19:04:09 2010 for libDAI by  doxygen 1.5.5