Namespace MoreStructures.RecImmTrees.Visitor
Classes
BreadthFirstTraversal<TEdge, TNode>
Base class for all BFT strategies, i.e. all traversing strategies which visit all the nodes at the current depth, along any path of the tree, before going deeper or shallower, exploring nodes with higher or lower depth.
DepthFirstTraversal<TEdge, TNode>
Base class for all DFS strategies, i.e. all traversing strategies which goes in depth as far as possible along each path of the tree, only backtracking when a leaf is reached.
FullyIterativeBreadthFirstTraversal<TEdge, TNode>
A lazy, fully-iterative, breadth-first IVisitStrategy<TNode, TVisitContext> implementation, i.e. a traversing strategy which visits all the nodes at the current depth, along any path of the tree, before going deeper or shallower, exploring nodes with higher or lower depth.
FullyIterativeDepthFirstTraversal<TEdge, TNode>
A lazy, fully-iterative, depth-first IVisitStrategy<TNode, TVisitContext> implementation, i.e. a traversing strategy which goes in depth as far as possible along each path of the tree, only backtracking when a leaf is reached.
FullyRecursiveBreadthFirstTraversal<TEdge, TNode>
A lazy, fully-recursive, breadth-first IVisitStrategy<TNode, TVisitContext> implementation, i.e. a traversing strategy which visits all the nodes at the current depth, along any path of the tree, before going deeper or shallower, exploring nodes with higher or lower depth.
FullyRecursiveDepthFirstTraversal<TEdge, TNode>
A lazy, fully-recursive, depth-first IVisitStrategy<TNode, TVisitContext> implementation, i.e. a traversing strategy which goes in depth as far as possible along each path of the tree, only backtracking when a leaf is reached.
TreeTraversal<TEdge, TNode>
Base class for all tree traversal strategies, such as DepthFirstTraversal<TEdge, TNode> and BreadthFirstTraversal<TEdge, TNode> strategies, which are different strategies of traversing a IRecImmDictIndexedTreeNode<TEdge, TNode> structure top-down.
TreeTraversalVisit<TEdge, TNode>
The emitted information of a root-to-leaf traversal of a tree composed of
Interfaces
IVisitStrategy<TNode, TVisitContext>
A visit strategy of IRecImmDictIndexedTreeNode<TEdge, TNode> structures. Can be any way of moving through the structure and touching nodes: partial or exaustive, hierarchical or random, upwards or downwards, etc.
Enums
TreeTraversalOrder
The order of visit of a "node and its children" sub-tree.