Previous instalments General Data Structures HashList ObjectMatrix Trees GeneralTree and the Visitor Pattern Binary Trees and Binary Search Trees The Priority Queue data structure has the same basic behaviour and operations as the classic queue found in .NET . A queue applies a first-in, first-out (FIFO ) approach to a list of objects. This data …
Previous instalments General Data Structures HashList Trees GeneralTree and the Visitor Pattern Binary Trees and Binary Search Trees Looking at tree structures will make your eyes bleed, so we’ll take a break to discuss one of the simpler data structures NGenerics offers - the ObjectMatrix . The ObjectMatrix is a representation of a …
Previous instalments General Data Structures HashList Trees GeneralTree and the Visitor Pattern If you haven’t read my previous post on General Trees, it might be a good idea to do so before reading further. A Binary Tree is a refined version of the General Tree that limits the number of children each node can have - two to be exact. Child …
Previous instalments General Data Structures HashList [ Note : This post feels like Computer Science 101 - but I felt it necessary to discuss the basic tree concepts before we move on to some of the more specialized trees like search trees. ] The GeneralTree<T> class in NGenerics provides a way of defining tree structures in a simple, …
Something that I find a use for in almost every project I work on, is the HashList (also known as a MultiMap in the Java world) in NGenerics 1.2. A HashList is a multi-valued dictionary that uses a Dictionary<TKey, IList> under the covers. It still retains dictionary semantics but handles the creation and destruction of the key/list pairs …
Yeah, NGenerics 1.2 has been released! If you haven’t checked it out yet, do so now - no decent programmer should go without a toolbox of data structures and algorithms.
My data structures article on CodeProject has grown up and became a project on CodePlex GitHub .
I’ve posted an article on generic data structures on CodeProject. At the moment, it provides the following data structures : Deque GeneralTree BinaryTree SorterList Heap Bag Set Graph Association Matrix I’ve also implemented a couple of sorting algorithms. If you get a change, go check it out , and give me some feedback.