Elementary.Hierarchy 1.4.0

There is a newer version of this package available.
See the version list below for details. 
dotnet add package Elementary.Hierarchy --version 1.4.0                

                    
                

            
NuGet\Install-Package Elementary.Hierarchy -Version 1.4.0
This command is intended to be used within the Package Manager Console in Visual Studio, as it uses the NuGet module's version of Install-Package. 
<PackageReference Include="Elementary.Hierarchy" Version="1.4.0" />
For projects that support PackageReference, copy this XML node into the project file to reference the package. 
paket add Elementary.Hierarchy --version 1.4.0                

                    
                

            
#r "nuget: Elementary.Hierarchy, 1.4.0"
#r directive can be used in F# Interactive and Polyglot Notebooks. Copy this into the interactive tool or source code of the script to reference the package. 
// Install Elementary.Hierarchy as a Cake Addin
#addin nuget:?package=Elementary.Hierarchy&version=1.4.0

// Install Elementary.Hierarchy as a Cake Tool
#tool nuget:?package=Elementary.Hierarchy&version=1.4.0

Elementary Hierarchy provides structures and algorithms for developing of tree-like/hierarchical data structures.

There are no supported framework assets in this package.

Learn more about Target Frameworks and .NET Standard.

This package has no dependencies.

NuGet packages (1)

Showing the top 1 NuGet packages that depend on Elementary.Hierarchy:

Package Downloads
Elementary.Compare

Elementary Compare provides reflection based object comparision algorithms.

GitHub repositories

This package is not used by any popular GitHub repositories.

Version Downloads Last updated
2.1.1 976 2/2/2019
2.1.0 1,073 8/3/2018
2.0.0 989 1/27/2018
1.7.1 1,420 12/28/2016
1.7.0 980 12/11/2016
1.6.0 1,162 11/5/2016
1.4.0 1,136 4/20/2016
1.3.0 975 3/25/2016
1.0.1 1,225 3/2/2016
1.0.0 1,236 3/2/2016

Improved retrieval of descendants: Nodes may implement IHasDescendantNodes interface if they know a better way to retrieve descendants then just traversing the child nodes recursively