Vienna Graph Template Library: Class Members

Here is a list of all documented class members with links to the class documentation for each member:

- e -

edge : __DG< _Tp, _Ctr, _Iterator, _CIterator, _Inserter, _Alloc >
edge_allocator_type : __LDG< _Tp, _Te, _Ctr, _Iterator, _CIterator, _Inserter, _NAlloc, _EAlloc > , _LDG_base< _Tp, _Ctr, _Iterator, _CIterator, _Te, _NAlloc, _EAlloc >
edge_type : _LDG_walker< _Tp, _Ref, _Ptr, _Ctr, _Iterator, _CIterator, _Te > , __LDG< _Tp, _Te, _Ctr, _Iterator, _CIterator, _Inserter, _NAlloc, _EAlloc >
edge_value_type : _LDG_walker< _Tp, _Ref, _Ptr, _Ctr, _Iterator, _CIterator, _Te >
empty() : __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc > , __LDG< _Tp, _Te, _Ctr, _Iterator, _CIterator, _Inserter, _NAlloc, _EAlloc > , __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc > , __DG< _Tp, _Ctr, _Iterator, _CIterator, _Inserter, _Alloc >
end() : __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc > , __ITree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >
enhanced_edge : __DG< _Tp, _Ctr, _Iterator, _CIterator, _Inserter, _Alloc >
erase() : __DG< _Tp, _Ctr, _Iterator, _CIterator, _Inserter, _Alloc > , __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc > , __LDG< _Tp, _Te, _Ctr, _Iterator, _CIterator, _Inserter, _NAlloc, _EAlloc > , __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >
erase_child() : __DG< _Tp, _Ctr, _Iterator, _CIterator, _Inserter, _Alloc > , __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc > , __LDG< _Tp, _Te, _Ctr, _Iterator, _CIterator, _Inserter, _NAlloc, _EAlloc > , __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >
erase_maximal_pregraph() : __DG< _Tp, _Ctr, _Iterator, _CIterator, _Inserter, _Alloc > , __LDG< _Tp, _Te, _Ctr, _Iterator, _CIterator, _Inserter, _NAlloc, _EAlloc >
erase_maximal_subgraph() : __LDG< _Tp, _Te, _Ctr, _Iterator, _CIterator, _Inserter, _NAlloc, _EAlloc > , __DG< _Tp, _Ctr, _Iterator, _CIterator, _Inserter, _Alloc > , __LDG< _Tp, _Te, _Ctr, _Iterator, _CIterator, _Inserter, _NAlloc, _EAlloc >
erase_minimal_pregraph() : __LDG< _Tp, _Te, _Ctr, _Iterator, _CIterator, _Inserter, _NAlloc, _EAlloc > , __DG< _Tp, _Ctr, _Iterator, _CIterator, _Inserter, _Alloc > , __LDG< _Tp, _Te, _Ctr, _Iterator, _CIterator, _Inserter, _NAlloc, _EAlloc >
erase_minimal_subgraph() : __DG< _Tp, _Ctr, _Iterator, _CIterator, _Inserter, _Alloc > , __LDG< _Tp, _Te, _Ctr, _Iterator, _CIterator, _Inserter, _NAlloc, _EAlloc >
erase_parent() : __DG< _Tp, _Ctr, _Iterator, _CIterator, _Inserter, _Alloc > , __LDG< _Tp, _Te, _Ctr, _Iterator, _CIterator, _Inserter, _NAlloc, _EAlloc >
erase_subtree() : __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc > , __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >
erase_tree() : __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc > , __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >
erased_part : ldgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > , dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > , ldag< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > , __LDG< _Tp, _Te, _Ctr, _Iterator, _CIterator, _Inserter, _NAlloc, _EAlloc > , __DG< _Tp, _Ctr, _Iterator, _CIterator, _Inserter, _Alloc > , dag< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >