_LDG_node< _Tp, _Ctr, _Iterator > Class Template Reference
[Classes and types for internal use]
labelled directed graph node
More...
#include <vgtl_ldagbase.h>
Public Member Functions | |
| _LDG_node () | |
| ~_LDG_node () | |
| void | clear_in_edges () |
| void | clear_out_edges () |
| _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_in_edges (_Ctr_iterator first, _Ctr_iterator last, Compare comp) |
| template<class Compare > | |
| void | sort_out_edges (_Ctr_iterator first, _Ctr_iterator last, Compare comp) |
Public Attributes | |
| _Tp * | _C_data |
| _Ctr | _C_inedges |
| _Ctr | _C_outedges |
| int | _C_visited |
Detailed Description
template<class _Tp, class _Ctr, class _Iterator>
class _LDG_node< _Tp, _Ctr, _Iterator >
This is the node for a directed graph
Definition at line 45 of file vgtl_ldagbase.h.
Constructor & Destructor Documentation
| _LDG_node< _Tp, _Ctr, _Iterator >::_LDG_node | ( | ) | [inline] |
standard constructor
Definition at line 63 of file vgtl_ldagbase.h.
| _LDG_node< _Tp, _Ctr, _Iterator >::~_LDG_node | ( | ) | [inline] |
standard destructor
Definition at line 74 of file vgtl_ldagbase.h.
Member Function Documentation
| void _LDG_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 146 of file vgtl_ldagbase.h.
| void _LDG_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 161 of file vgtl_ldagbase.h.
| void _LDG_node< _Tp, _Ctr, _Iterator >::clear_in_edges | ( | ) | [inline] |
erase all in edges
Definition at line 84 of file vgtl_ldagbase.h.
| void _LDG_node< _Tp, _Ctr, _Iterator >::clear_out_edges | ( | ) | [inline] |
erase all out edges
Definition at line 87 of file vgtl_ldagbase.h.
| _Ctr_iterator _LDG_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 91 of file vgtl_ldagbase.h.
| _Ctr_iterator _LDG_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 100 of file vgtl_ldagbase.h.
| void _LDG_node< _Tp, _Ctr, _Iterator >::sort_in_edges | ( | _Ctr_iterator | first, | |
| _Ctr_iterator | last, | |||
| Compare | comp | |||
| ) | [inline] |
sort the children according to comp
Definition at line 127 of file vgtl_ldagbase.h.
| void _LDG_node< _Tp, _Ctr, _Iterator >::sort_out_edges | ( | _Ctr_iterator | first, | |
| _Ctr_iterator | last, | |||
| Compare | comp | |||
| ) | [inline] |
sort the parents according to comp
Definition at line 134 of file vgtl_ldagbase.h.
Member Data Documentation
the node data
Definition at line 54 of file vgtl_ldagbase.h.
| _Ctr _LDG_node< _Tp, _Ctr, _Iterator >::_C_inedges |
the edges to the parents
Definition at line 56 of file vgtl_ldagbase.h.
| _Ctr _LDG_node< _Tp, _Ctr, _Iterator >::_C_outedges |
the edges to the children
Definition at line 58 of file vgtl_ldagbase.h.
| int _LDG_node< _Tp, _Ctr, _Iterator >::_C_visited |
internal counter for marks in algorithms
Definition at line 60 of file vgtl_ldagbase.h.
The documentation for this class was generated from the following file:
