digraph_node< NODE, EDGE > Struct Template Reference

#include <graph.h>

Collaboration diagram for digraph_node< NODE, EDGE >:

[legend]

List of all members.

Public Types
typedef digraph_edge< NODE, EDGE >	digraph_edge
typedef digraph< NODE, EDGE >	digraph
typedef succ_node_iter< digraph >	succ_node_iter
typedef pred_node_iter< digraph >	pred_node_iter
Public Member Functions
void	add_succ (digraph_edge *e)
void	add_pred (digraph_edge *e)
void	delete_succ_edge (digraph_edge *e)
void	delete_pred_edge (digraph_edge *e)
succ_node_iter	succ_node_begin () const
succ_node_iter	succ_node_end () const
pred_node_iter	pred_node_begin () const
pred_node_iter	pred_node_end () const
	digraph_node (NODE v)
	digraph_node ()
Public Attributes
NODE	node
int	n_succ
int	n_pred
digraph_edge *	first_succ
digraph_edge *	first_pred

---

Detailed Description

template<class NODE, class EDGE>
struct digraph_node< NODE, EDGE >

Definition at line 170 of file graph.h.

---

Member Typedef Documentation

template<class NODE , class EDGE >

typedef digraph<NODE, EDGE> digraph_node< NODE, EDGE >::digraph

Definition at line 172 of file graph.h.

template<class NODE , class EDGE >

typedef digraph_edge<NODE, EDGE> digraph_node< NODE, EDGE >::digraph_edge

Definition at line 171 of file graph.h.

template<class NODE , class EDGE >

typedef pred_node_iter<digraph> digraph_node< NODE, EDGE >::pred_node_iter

Definition at line 174 of file graph.h.

template<class NODE , class EDGE >

typedef succ_node_iter<digraph> digraph_node< NODE, EDGE >::succ_node_iter

Definition at line 173 of file graph.h.

---

Constructor & Destructor Documentation

template<class NODE , class EDGE >

digraph_node< NODE, EDGE >::digraph_node

(

NODE

v

)

[inline]

template<class NODE , class EDGE >

digraph_node< NODE, EDGE >::digraph_node

(

)

[inline]

---

Member Function Documentation

template<class NODE , class EDGE >

void digraph_node< NODE, EDGE >::add_pred

(

digraph_edge *

e

)

[inline]

Definition at line 183 of file graph.h.

References digraph_node< NODE, EDGE >::first_pred, digraph_node< NODE, EDGE >::n_pred, and digraph_edge< NODE, EDGE >::next_pred.

Referenced by digraph< NODE, EDGE >::add_edge().

template<class NODE , class EDGE >

void digraph_node< NODE, EDGE >::add_succ

(

digraph_edge *

e

)

[inline]

Definition at line 182 of file graph.h.

References digraph_node< NODE, EDGE >::first_succ, digraph_node< NODE, EDGE >::n_succ, and digraph_edge< NODE, EDGE >::next_succ.

Referenced by digraph< NODE, EDGE >::add_edge().

template<class NODE , class EDGE >

void digraph_node< NODE, EDGE >::delete_pred_edge

(

digraph_edge *

e

)

[inline]

Definition at line 195 of file graph.h.

References digraph_node< NODE, EDGE >::first_pred, and digraph_edge< NODE, EDGE >::next_pred.

Referenced by digraph< NODE, EDGE >::delete_edge().

template<class NODE , class EDGE >

void digraph_node< NODE, EDGE >::delete_succ_edge

(

digraph_edge *

e

)

[inline]

Definition at line 185 of file graph.h.

References digraph_node< NODE, EDGE >::first_succ, and digraph_edge< NODE, EDGE >::next_succ.

Referenced by digraph< NODE, EDGE >::delete_edge(), and digraph< NODE, EDGE >::delete_node_and_edge().

template<class NODE , class EDGE >

pred_node_iter digraph_node< NODE, EDGE >::pred_node_begin

(

)

const [inline]

Definition at line 211 of file graph.h.

References pred_node_iter< DIGRAPH >::cur, digraph_node< NODE, EDGE >::first_pred, and s.

template<class NODE , class EDGE >

pred_node_iter digraph_node< NODE, EDGE >::pred_node_end

(

)

const [inline]

Definition at line 214 of file graph.h.

References pred_node_iter< DIGRAPH >::cur, and s.

template<class NODE , class EDGE >

succ_node_iter digraph_node< NODE, EDGE >::succ_node_begin

(

)

const [inline]

Definition at line 205 of file graph.h.

References succ_node_iter< DIGRAPH >::cur, digraph_node< NODE, EDGE >::first_succ, and s.

template<class NODE , class EDGE >

succ_node_iter digraph_node< NODE, EDGE >::succ_node_end

(

)

const [inline]

Definition at line 208 of file graph.h.

References succ_node_iter< DIGRAPH >::cur, and s.

---

Member Data Documentation

template<class NODE , class EDGE >

digraph_edge* digraph_node< NODE, EDGE >::first_pred

Definition at line 180 of file graph.h.

Referenced by digraph_node< NODE, EDGE >::add_pred(), digraph< NODE, EDGE >::delete_node_and_edge(), digraph_node< NODE, EDGE >::delete_pred_edge(), and digraph_node< NODE, EDGE >::pred_node_begin().

template<class NODE , class EDGE >

digraph_edge* digraph_node< NODE, EDGE >::first_succ

Definition at line 179 of file graph.h.

Referenced by digraph_node< NODE, EDGE >::add_succ(), digraph< NODE, EDGE >::delete_node_and_edge(), digraph_node< NODE, EDGE >::delete_succ_edge(), digraph< NODE, EDGE >::pred_edge_begin(), digraph< NODE, EDGE >::pred_node_begin(), digraph< NODE, EDGE >::succ_edge_begin(), digraph< NODE, EDGE >::succ_node_begin(), and digraph_node< NODE, EDGE >::succ_node_begin().

template<class NODE , class EDGE >

int digraph_node< NODE, EDGE >::n_pred

Definition at line 178 of file graph.h.

Referenced by digraph_node< NODE, EDGE >::add_pred().

template<class NODE , class EDGE >

int digraph_node< NODE, EDGE >::n_succ

Definition at line 177 of file graph.h.

Referenced by digraph_node< NODE, EDGE >::add_succ().

template<class NODE , class EDGE >

NODE digraph_node< NODE, EDGE >::node

Definition at line 176 of file graph.h.

---

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

• osprey1.0/common/util/graph.h