search

This project produces a .Net Standard Library or .Net 4.0 Library with Generic and IEnumerable/Yield (LevelOrder, PreOrder, PostOrder) tree traversal methods to traverse k-ary trees in different orders via IEnumerable<T>/Yield<T>.

v1.2.0

↙ 25.4K / total

generictreetraversalmethodLevelOrder

pkg

Traverse

Explore trees and tree-like structures with LINQ using tree-traversal algorithms like breadth-first and depth-first search: IEnumerable<DirectoryInfo> childDirectories = Traverse.DepthFirst(new DirectoryInfo(...), d => d.EnumerateDirectories()); IEnumerable<DirectoryInfo> parentDirectories = Traverse.Along(new DirectoryInfo(...), d => d.Parent);

v1.0.1

↙ 14.7K / total

breadthdepthfirstpreorderpostorder

pkg

Abstract.DataStructures.Algorithms

Algorithms for sorting and searching Containing Quicksort, Sub Sort Transpose Sort, SelectionSort, InsertionSort, MergeSort, InOrder, PreOrder, Binary Search

v2022.2.17.6

↙ 3.3K / total

QuicksortSubSortTransposeSort

pkg

QuantumCode.Tree.MPTTA

Modified Preorder Tree Traversal Algorithm 的实现

v0.4.3

↙ 10.1K / total

pkg

MultiwayTree

Package Description

v1.1.0

↙ 713 / total

treen-aryk-arynarykary

pkg

QuantumCode.LRTree

一个对左右值树操作的工具类库示例程序到项目网站中下载源代码 0.3.3版本是最后一个版本，此后改名为QuantmCode.Tree.MPTTA(Modified Preorder Tree Traversal Algorithm) 继续发布。

v0.3.3

↙ 16.9K / total