#include <vgtl_dagbase.h>
Inheritance diagram for _DG_node< _Tp, _Ctr, _Iterator >:
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 |
Definition at line 44 of file vgtl_dagbase.h.
|
standard constructor Definition at line 62 of file vgtl_dagbase.h. |
|
standard destructor Definition at line 73 of file vgtl_dagbase.h. |
|
add all children to parent Definition at line 142 of file vgtl_dagbase.h. |
|
add all parents to child Definition at line 157 of file vgtl_dagbase.h. |
|
erase all children entries Definition at line 80 of file vgtl_dagbase.h. |
|
erase all parents entries Definition at line 83 of file vgtl_dagbase.h. |
|
find the iterator into the children container for child Definition at line 87 of file vgtl_dagbase.h. |
|
find the iterator into the parents container for parent Definition at line 96 of file vgtl_dagbase.h. |
|
sort the children according to Definition at line 123 of file vgtl_dagbase.h. |
|
sort the parents according to Definition at line 130 of file vgtl_dagbase.h. |
|
the edges to the children Definition at line 57 of file vgtl_dagbase.h. |
|
the node data Definition at line 53 of file vgtl_dagbase.h. |
|
the edges to the parents Definition at line 55 of file vgtl_dagbase.h. |
|
internal counter for marks in algorithms Definition at line 59 of file vgtl_dagbase.h. |