A Node stores address of value of type T and pointer to an emanating edge. More...

#include <vsr_graph.h>

Public Member Functions
T &	data ()
	Get reference to data;.

T	data () const

Node &	data (T &v)

vector< HalfEdge * >	valence () const
	Find all outgoing Edges.

vector< HalfEdge * >	edgeLoop () const
	Find edge loop (next of edges)

bool	closed () const
	Test for node closure (no null Edges in loop)

HalfEdge &	null ()
	Find any null edge of a node.

vector< HalfEdge * >	nulls ()
	Find both null edges around a node.

vector< Face * >	faces ()
	Find all faces.

vector< Node * >	neighbors ()
	Find all Neighboring nodes.

void	visited (bool t)

bool	visited ()

void	reset ()

Public Attributes
T *	ptr
	Pointer to type T.

HalfEdge *	edge
	An emanating half-edge.

bool	bVisited
	Flag for keeping track of visitation.

Detailed Description

A Node stores address of value of type T and pointer to an emanating edge.

It includes functions for finding all emanating edges, faces, connected neighbors,

and a boolean visitation flag that can be set to avoid endless looping algorithms

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