 | Tree |
Service providing tree traversal algorithms for InternalElement Trees.
Inheritance HierarchyNamespace: Aml.Engine.Services.TreeTraversal
Assembly: Aml.Engine.Services.TreeTraversal (in Aml.Engine.Services.TreeTraversal.dll) Version: 2.0
SyntaxThe TreeTraversalService type exposes the following members.
Constructors| Name | Description | |
|---|---|---|
 | TreeTraversalService | Initializes a new instance of the TreeTraversalService class |
Methods| Name | Description | |
|---|---|---|
| BreathFirst(InstanceHierarchyType, PredicateInternalElementType) | A BreathFirst Traversal algorithm, which can be used to traverse an InstanceHierarchy tree via foreach (var item in collection){ ... }. A predicate can be specified to restrict the element selection. |
| BreathFirst(InternalElementType, PredicateInternalElementType) | A BreathFirst Traversal algorithm, which can be used to traverse an InternalElement tree via foreach (var item in collection){ ... }. A predicate can be specified to restrict the element selection. |
| DepthFirstPostOrder(InstanceHierarchyType, PredicateInternalElementType) | A DepthFirst (Post-Order) Traversal algorithm, which can be used to traverse an InstanceHierarchy tree in post order via foreach (var item in collection){ ... }. A predicate can be specified to restrict the element selection. |
| DepthFirstPostOrder(InternalElementType, PredicateInternalElementType) | A DepthFirst (Post-Order) Traversal algorithm, which can be used to traverse an InternalElement tree in post order via foreach (var item in collection){ ... }. A predicate can be specified to restrict the element selection. |
| DepthFirstPreOrder(IInternalElementContainer, PredicateInternalElementType) | A DepthFirst (Pre-Order) Traversal algorithm, which can be used to traverse an InstanceHierarchy tree in pre order via foreach (var item in collection){ ... }. A predicate can be specified to restrict the element selection. |
| DepthFirstPreOrder(InternalElementType, PredicateInternalElementType) | A DepthFirst (Pre-Order) Traversal algorithm, which can be used to traverse an InternalElement tree in pre order via foreach (var item in collection){ ... }. A predicate can be specified to restrict the element selection. |
 | Register | Registers a new instance of a TreeTraversalService with the ServiceLocator of the AMLEngine. |
| UnRegister | Unregisters this service |
Remarks
This implementation is based on http://urosv.blogspot.de/2011/04/iterative-binary-tree-traversal.html
C/C++ Blog Post by: Uros Vidojevic and https://github.com/Dirkster99/TreeLib/ published under MIT License.
The sourcecode is used as it is. The original NUGET assemblies are signed.
See Also