Main Page   Modules   Class Hierarchy   Alphabetical List   Compound List   File List   Compound Members   File Members  

_DG_node< _Tp, _Ctr, _Iterator > Class Template Reference
[Classes and types for internal use]

directed graph node More...

#include <vgtl_dagbase.h>

Inheritance diagram for _DG_node< _Tp, _Ctr, _Iterator >:

Inheritance graph
[legend]
Collaboration diagram for _DG_node< _Tp, _Ctr, _Iterator >:

Collaboration graph
[legend]
List of all members.

Public Methods

 _DG_node ()
 ~_DG_node ()
void clear_children ()
void clear_parents ()
_Ctr_iterator get_childentry_iterator (const _Void_pointer __p)
_Ctr_iterator get_parententry_iterator (const _Void_pointer __p)
template<class _Output_Iterator> void add_all_children (_Output_Iterator fi, _Self *_parent)
template<class _Output_Iterator> void add_all_parents (_Output_Iterator fi, _Self *_child)
template<class Compare> void sort_child_edges (_Ctr_iterator first, _Ctr_iterator last, Compare comp)
template<class Compare> void sort_parent_edges (_Ctr_iterator first, _Ctr_iterator last, Compare comp)

Public Attributes

_Tp _C_data
_Ctr _C_parents
_Ctr _C_children
int _C_visited

Detailed Description

template<class _Tp, class _Ctr, class _Iterator>
class _DG_node< _Tp, _Ctr, _Iterator >

This is the node for a directed graph

Definition at line 44 of file vgtl_dagbase.h.


Constructor & Destructor Documentation

template<class _Tp, class _Ctr, class _Iterator>
_DG_node< _Tp, _Ctr, _Iterator >::_DG_node   [inline]
 

standard constructor

Definition at line 62 of file vgtl_dagbase.h.

template<class _Tp, class _Ctr, class _Iterator>
_DG_node< _Tp, _Ctr, _Iterator >::~_DG_node   [inline]
 

standard destructor

Definition at line 73 of file vgtl_dagbase.h.


Member Function Documentation

template<class _Tp, class _Ctr, class _Iterator>
template<class _Output_Iterator>
void _DG_node< _Tp, _Ctr, _Iterator >::add_all_children _Output_Iterator    fi,
_Self *    _parent
[inline]
 

add all children to parent _parent. fi is an iterator to the children container of _parent

Definition at line 142 of file vgtl_dagbase.h.

template<class _Tp, class _Ctr, class _Iterator>
template<class _Output_Iterator>
void _DG_node< _Tp, _Ctr, _Iterator >::add_all_parents _Output_Iterator    fi,
_Self *    _child
[inline]
 

add all parents to child _child. fi is an iterator to the parents container of _child

Definition at line 157 of file vgtl_dagbase.h.

template<class _Tp, class _Ctr, class _Iterator>
void _DG_node< _Tp, _Ctr, _Iterator >::clear_children   [inline]
 

erase all children entries

Definition at line 80 of file vgtl_dagbase.h.

template<class _Tp, class _Ctr, class _Iterator>
void _DG_node< _Tp, _Ctr, _Iterator >::clear_parents   [inline]
 

erase all parents entries

Definition at line 83 of file vgtl_dagbase.h.

template<class _Tp, class _Ctr, class _Iterator>
_Ctr_iterator _DG_node< _Tp, _Ctr, _Iterator >::get_childentry_iterator const _Void_pointer    __p [inline]
 

find the iterator into the children container for child __p

Definition at line 87 of file vgtl_dagbase.h.

template<class _Tp, class _Ctr, class _Iterator>
_Ctr_iterator _DG_node< _Tp, _Ctr, _Iterator >::get_parententry_iterator const _Void_pointer    __p [inline]
 

find the iterator into the parents container for parent __p

Definition at line 96 of file vgtl_dagbase.h.

template<class _Tp, class _Ctr, class _Iterator>
template<class Compare>
void _DG_node< _Tp, _Ctr, _Iterator >::sort_child_edges _Ctr_iterator    first,
_Ctr_iterator    last,
Compare    comp
[inline]
 

sort the children according to comp

Definition at line 123 of file vgtl_dagbase.h.

template<class _Tp, class _Ctr, class _Iterator>
template<class Compare>
void _DG_node< _Tp, _Ctr, _Iterator >::sort_parent_edges _Ctr_iterator    first,
_Ctr_iterator    last,
Compare    comp
[inline]
 

sort the parents according to comp

Definition at line 130 of file vgtl_dagbase.h.


Member Data Documentation

template<class _Tp, class _Ctr, class _Iterator>
_Ctr _DG_node< _Tp, _Ctr, _Iterator >::_C_children
 

the edges to the children

Definition at line 57 of file vgtl_dagbase.h.

template<class _Tp, class _Ctr, class _Iterator>
_Tp _DG_node< _Tp, _Ctr, _Iterator >::_C_data
 

the node data

Definition at line 53 of file vgtl_dagbase.h.

template<class _Tp, class _Ctr, class _Iterator>
_Ctr _DG_node< _Tp, _Ctr, _Iterator >::_C_parents
 

the edges to the parents

Definition at line 55 of file vgtl_dagbase.h.

template<class _Tp, class _Ctr, class _Iterator>
int _DG_node< _Tp, _Ctr, _Iterator >::_C_visited
 

internal counter for marks in algorithms

Definition at line 59 of file vgtl_dagbase.h.


The documentation for this class was generated from the following file:
Generated on Tue Nov 4 01:41:36 2003 for Vienna Graph Template Library by doxygen1.2.18