Go to the source code of this file.
Go to the SVN repository for this file.
◆ ETreeMethod ◆ GetMaxPath() [1/2]Definition at line 201 of file cuSeqTreeAlg.cpp.
References tree< T, tree_node_allocator >::append_child(), tree< T, tree_node_allocator >::begin(), tree< T, tree_node_allocator >::clear(), tree< T, tree_node_allocator >::end(), tree< T, tree_node_allocator >::insert(), tree< T, tree_node_allocator >::iterator_base::is_valid(), tree< T, tree_node_allocator >::next_sibling(), result, and tree< T, tree_node_allocator >::size().
Referenced by GetMaxPath(), and MidpointRootSeqTree().
◆ GetMaxPath() [2/2] ◆ GetTreeAlgorithmName() ◆ MidpointRootSeqTree()Definition at line 49 of file cuSeqTreeAlg.cpp.
References tree< T, tree_node_allocator >::append_child(), tree< T, tree_node_allocator >::iterator_base::begin(), tree< T, tree_node_allocator >::begin(), count, SeqItem::distance, tree< T, tree_node_allocator >::iterator_base::end(), tree< T, tree_node_allocator >::end(), GetMaxPath(), tree< T, tree_node_allocator >::iterator_base::is_valid(), newTree(), tree< T, tree_node_allocator >::next_sibling(), tree< T, tree_node_allocator >::number_of_children(), tree< T, tree_node_allocator >::number_of_siblings(), tree< T, tree_node_allocator >::parent(), tree< T, tree_node_allocator >::previous_sibling(), tree< T, tree_node_allocator >::reparent(), tree< T, tree_node_allocator >::reroot(), result, and tree< T, tree_node_allocator >::size().
Referenced by TreeAlgorithm::midpointRootIfNeeded().
◆ USING_SCOPE() ◆ GLOBAL_DEFAULT_ALGORITHM ◆ NUMBER_OF_TREE_ALGORITHMS ◆ RESET_WITH_TINY_DISTANCE const double RESET_WITH_TINY_DISTANCE = 0.0001 ◆ TREE_ALGORITHM_NAMESRetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4