Select a tag to browse associated projects and drill deeper into the tag cloud.
jtTreeJs
J
Analyzed 1 day ago
A javascript helper to build Tree user interface. Built in Tribunal de Justiça do Tocantins, Brazil
Licenses:
mit
Qtombo
Q
Analyzed about 19 hours ago
Qtombo is a tree and multiple-file based note system inspired by tombo (for windows and PPC), written with Qt. Supports the encrypted notes of tombo. One note is one file, plain text if possible. Note tree is a directory tree.
distribute-on{to,}-CDs
D
Analyzed about 15 hours ago
Distribute-a-collection-of-packages-on{to,}-multiple-CDs. Especially good for future use with APT.
"distribute" program makes doing the tasks related to creating a CD set for distribution of a collection of packages easier. The tasks include:
* laying out the CDs filesystem (splitting the large
NeuroCrypto
N
Analyzed about 24 hours ago
This is a C++ implementation of the concept of Neural Cryptography, which is a communication of two tree parity machines for agreement on a common key over a public channel. This exchanged public key is utilized to encrypt a sensitive message to be transmitted over an insecure channel using Rijndael
Licenses:
apache_2
tree-grid-directive
T
Analyzed about 2 hours ago
A grid to display data in tree structure by using Angular and Bootstrap.
gramps-addons
G
Analyzed about 23 hours ago
This is a collection of plugins for Gramps open source genealogy application. These addons extend Gramps functionality with additional reports, gramplets, tools, and views. For more information on Gramps, see http://gramps-project.org/
Licenses:
No declared licenses
Treecomp
T
Analyzed about 7 hours ago
TreeComp is a ANSI C++ library that provides data structures for the generation, storage and manipulation of trees. It is STL conform so that STL algorithms can be used. The design was made using design patterns.
Rbppavl - PHP AVL binary search tree
R
Analyzed about 24 hours ago
PHP AVL binary search tree.
A set of PHP classes implementing binary search trees that comply to AVL rules. The API exposes methods for tree operations (insert, replace, delete, find), and for inorder traversal (find, first, last, prev, next, curr). Tree and traversal operations implement relaxed