https://github.com/dirkster99/treelib

A .Net Standard Library with Generic methods to traverse k-ary trees in any order required.
https://github.com/dirkster99/treelib

algorithms breadth-first-search depth-first-search dotnet-standard generic generic-methods graph-algorithms ienumerable ienumerable-extension levelorder postorder preorder traversal traversal-methods tree

Last synced: 2 days ago
JSON representation

A .Net Standard Library with Generic methods to traverse k-ary trees in any order required.

• Host: GitHub
• URL: https://github.com/dirkster99/treelib
• Owner: Dirkster99
• License: mit
• Created: 2017-10-06T20:59:06.000Z (almost 7 years ago)
• Default Branch: master
• Last Pushed: 2019-07-05T17:42:39.000Z (about 5 years ago)
• Last Synced: 2024-04-28T20:37:23.437Z (5 months ago)
• Topics: algorithms, breadth-first-search, depth-first-search, dotnet-standard, generic, generic-methods, graph-algorithms, ienumerable, ienumerable-extension, levelorder, postorder, preorder, traversal, traversal-methods, tree
• Language: C#
• Homepage:
• Size: 85 KB
• Stars: 25
• Watchers: 5
• Forks: 6
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
[![Build status](https://ci.appveyor.com/api/projects/status/de18xc6i431xnlvg?svg=true)](https://ci.appveyor.com/project/Dirkster99/treelib)

[![Release](https://img.shields.io/github/release/Dirkster99/TreeLib.svg)](https://github.com/Dirkster99/TreeLib/releases/latest)

[![NuGet](https://img.shields.io/nuget/dt/Dirkster.TreeLib.svg)](http://nuget.org/packages/Dirkster.TreeLib)

# TreeLib

This project provides a:

- .Net Standard Library (1.4, 1.6, 2.0) or a

- .Net framework 4.0 Library

with Generic methods to traverse k-ary trees in different orders (Post-Order, Pre-Order, Level-Order) of traversal. This implementation includes scalable algorithms that return `IEnumerable` to make parsing large tree structures a piece of cake, as well, as [Generic Exception handling](https://github.com/Dirkster99/TreeLib/blob/adb9145b9c5baaf0ee8bd6f5fe5982354d962dc2/source/TreeLibNugetDemo/Demos/Directories/DirectorySize.cs#L85-#L86) to ensure that traversal algorithms complete despite unexpected errors on some nodes.

Review demo projects:

* in this solution,

* WPF FilterTreeView sample application, and read

* Advanced WPF TreeViews Part 3 of n

* Advanced WPF TreeViews Part 4 of n to learn more details.

Implementing something as complicated as a Post-Order traversal algorithm requires just:

* a project reference,

* a LINQ statement to find each set of children in the tree,

* and a simple for each loop to implement the operation on each tree node:

```C#

Console.WriteLine("(Depth First) PostOrder Tree Traversal V3");

items = TreeLib.Depthfirst.Traverse.PostOrder(root, i => i.Children);

foreach (var item in items)

{

  Console.WriteLine(item.GetPath());

}

```

This pattern leads to a clear-cut separation of:

* the traversal algorithm and

* the operations performed on each tree node (e.g.: `Console.WriteLine(item.GetPath());`).

The project in this repository contains a demo console project to demo its usage in more detail.

# Supported Generic Traversal Methods

## Breadth First

### Level Order

See TreeLib.BreadthFirst.Traverse.LevelOrder implementation for:

* Trees with 1 root node (expects 1 <T> root item as parameter)

* Trees with multiple root nodes (expects an IEnumerable<T> root item as parameter)

* Generic Level-Order function and DemoDirectoryTreeTraversal

## Depth First

### PreOrder

See TreeLib.BreadthFirst.Traverse.PreOrder implementation for:

* Trees with 1 root node (expects 1 <T> root item as parameter)

* Trees with multiple root nodes (expects IEnumerable<T> root as parameter)

* Generic Pre-Order function and DemoDirectoryTreeTraversal

### Postorder

See TreeLib.BreadthFirst.Traverse.Postorder implementation for:

* Trees with 1 root node (expects 1 <T> root item as parameter)

* Trees with multiple root nodes (expects IEnumerable<T> root item as parameter)

* Generic Post-Order function and DemoDirectoryTreeTraversal

# Tip

* Read about [Generic Tree and Linked List Traversal in C#](http://web.archive.org/web/20180128233111/http://www.codeducky.org/easy-tree-and-linked-list-traversal-in-c/) to understand the usefulness of *Generic* traversal methods.

* Watch the Binary tree traversal: Preorder, Inorder, Postorder video to better understand what is what (and why these Traversal Order Names make some sense):

* Look into data structure books online [Introduction to Trees, Binary Search Trees](https://cathyatseneca.gitbooks.io/data-structures-and-algorithms/introduction_to_trees,_binary_search_trees/definitions.html) or offline *[Algorithms](http://algs4.cs.princeton.edu/home/)* by Robert Sedgewick and Kevin Wayne, if you still need more background on tree structures