Search Results for "red black tree animated code in c"

Software projects are displayed by Gource as an animated tree with the root directory of the project at its centre. Directories appear as branches with files as leaves. Developers can be seen working on the tree at the times they contributed to the project. Gource includes built-in log generation support for Git, Mercurial, Bazaar and SVN. Gource can also parse logs produced by several third party tools for CVS repositories. Gource is a visualization tool for source control repositories...

... Development Group. The algorithms, source code, look-and-feel of WSJT-X and related programs, and protocol specifications for the modes FSK441, FT8, JT4, JT6M, JT9, JT65, JTMS, QRA64, ISCAT, MSK144, are Copyright © 2001-2017 by one or more of the following authors: Joseph Taylor, K1JT; Bill Somerville, G4WJS; Steven Franke, K9AN; Nico Palermo, IV3NWV; Greg Beam, KI7MT; Michael Black, W9MDB; Edson Pereira, PY2SDR; Philip Karn, KA9Q; and other members of the WSJT Development Group.

Very simple struct storage system, AVL and red-black tree based database library - database engine. You can define indexes over C struct.

.... If you downloaded offline maps to your phone or SD card, no cellular data is needed. Maps stored on your phone are used to display position. Windows Phone Store: http://www.windowsphone.com/s?appid=f519dba9-5601-4691-a614-2df33604452c Source code available on SF: https://sourceforge.net/p/trekme/code/ci/master/tree/ or on GITHUB: https://github.com/zbabac/TrekMe

A library written in C that provides a sorted list (based on an AVL or Red-Black tree) for sorting large amounts of data without using up all the physical memory. Uses disk if there is more data in the sorted list than there is memory available.

libcollections is a library that provides a reutilisable and comprehensive set of collections to your C code. Implemented so far: - linked list, - queue - stack To be implemented: - vector (arraylist) - red black tree - set - map

This application started out as a study of Newtonian physics, but evolved into a 2D simulation of the solar system. (Viewed from the south, because Jupiter just wouldn't be Jupiter without the great red spot.) The source code is available for developers who would like to make their own customizations and unique scenarios - like sending a black hole through the solar system. For the casual user, this program allows you to truly become familiar with the solar system. Flying a space ship...

A Threaded Red Black Tree in C# (cand be used both like a SortedSet and LinkedList) Implementing TopDown Deletion and TopDown Insertion mainly from http://eternallyconfuzzled.com with few personal flavours Time Complexity for inserting and deleting N nodes is O(NlogN) (both are 0-10% faster than SortedSet ) Time Complexity for Exist, Find, MoveNext is O(logN) Time complexity for Traversing N nodes is O(N) ( 30-40% faster than SortedSet because of using tree threads) Traversing in sorted...

AleRBTree C# generic class for manipulating and navigating red black tree

A fully functional red-black tree implemented in C++/CLI with an OO approach of naming and structuring which makes the code highly readable as well as easily portable to C# or Java. The package also includes a binary search tree and two traversal algorithms.

An interactive binary search tree. The user may interact with the tree by performing rotations, balancing, insertions, and deletions. For educational purposes

RED searches and deletes empty directories recursively below a given start folder and shows the result in a well arranged tree. Further you can create some custom rules for keeping and deleting folders. Empty files in directories can also be ignored.

Advanced algorithm library implemented by C

The project's purpose is to implement different types of data structures (Avl trees, Red-black trees, Binary heaps, etc.) using easy-to-read C code so it may be helpful to newbies to the world of data structure.

ADTL is an Advanced Data structures Template Library written in C++. it includs sixteen kinds of stl-like contains, such as fibonacci heap,pariring heap,skew heap,avl tree,red-black tree,splay tree,skip list, unrolled linked list and so on.

A C# Project Suite that contains an implementation of a Red-Black-Tree structure as well as a pretty Graphical frontent to play around with.

This is a fully STL-compliant C++ map/set/multimap/multiset implementation for g++ using an AVL tree instead of a Red-Black tree (that is present in current libstdc++).

spdict is a library of dictionary algorithms written in C++. It has support for sorted array, binary search tree, red-black tree, skip list, and balanced tree algorithms. Also include a cache class.

Red/Black Tree implementation. Port of the sourceforge libredblack library to C#. The package also consists of mutlitree (tree with non-unique key) and tree with quick direct access to items by the index.

This repository is an ongoing project of implementing generic data structures and algorithms in ANSI C. I find I often use the same constructs that require a lot of boilerplate code, so I made this repository to both organize these constructs and allow easy integration of these constructs into existing projects. My design philosophy with this repository is to offer a minimalistic API for each data structure, containing all tools needed to easily build more complex/niche constructs...