Tag : tree
Search objects from one map in another, as optimum as possible.
make-kd-node [median left right]: Creates a node in a kd-tree.
make-kd-tree [k depth points]: Creates a kd-tree of kd-nodes. TODO: Not stack safe. Use loop/recur.
kd-nearest-neighbor [a-point kd-tree]: Returns the nearest neighboring point to a given point, using a kd-tree.
|May 7, 2012|
Where nodes have rel attribute, in this case custom icon is for rel="file".
|November 15, 2011|
|Opening / closing jstree node||vtoman||jQuery||jsTree||
Clicking on node makes it toggle between opened and closed. Nodes needs to have id attribute for this to work.
|November 10, 2011|
|Expand MasterTree To Selected||Andrew Mauer||VB.NET||Expand MasterTree Selected||Expands a MasterTree control to the selected/current page.||June 9, 2011|
|Optimal Binary Search Tree||chinchang||C++||Optimal Binary Search Tree||This program makes a Optimal Binary values from the probablity inputs of the keys and dummy keys (internal nodes and leaves respectively). Features used: 1. dynamic allocation 2. templates 3. namespaces 4. recursion||April 14, 2011|
|Parsing XML using's Python's ElementTree||anarres||Python||elementtree||April 14, 2011|
|Infix->Postfix->Expression Tree||shubhangam||C||Infix->Postfix->Expression Tree||Takes an input in infix format and converts it to postfix notation and makes an expression tree out of it. Wrong inputs (unmatched parentheses) break the program (cause it to exit). Recognizes multiple letters/numbers as single operands eg 24-55 understands that 24 and 55 are individual operands.||March 27, 2011|
|Binary Tree||alias120||C++||Binary Tree||A simple implementation of a Binary Tree, intended for the beginner. Output is Pre-Order, so left-most nodes will be displayed before right-most. Output has been modified to help the programmer trace their way through the logical construction of the tree. Some ideas for implementation came from http://math.hws.edu/eck/cs225/s03/binary_trees/||March 21, 2011|
|Directory Size (Console)||Stephen Chappell||python||commandline directory sizeof tree||
Have you ever wanted to find out how much room a particular directory was taking up on your hard drive? A roommate of mine in college was having trouble keeping track of where his hard drive space is going, so the following program provided a solution that allows a brief overview of a directory's size along with all of its children. A tree view is printed out in ASCII characters showing the relationship of each directory along with its size in a format easily readable to humans. The output can always be redirected to a text file if it needs to be saved for viewing later on.
|February 8, 2011|
|Directory Size (GUI)||Stephen Chappell||python||application directory gui sizeof tree||
Have you ever wanted to find out how much room a particular directory was taking up on your hard drive? A roommate of mine in college was having trouble keeping track of where his hard drive space is going, so the following program provided a solution that allows a brief overview of a directory's size along with all of its children. A tree view is created using tkinter and is populated with the directory's name, cumulative size, immediate total file size, and full path. The search button is disabled during a search, and the directory listing with its children is automatically updated.
|February 8, 2011|
|Construct a Binary Tree given it's Post Order and In Order Traversals||japanir||C||Construct Binary Tree given it's Post Order Order Traversals||Given 2 arrays representing the binary tree's InOrder and PostOrder traversals, the function constructs and return that binary tree.||February 4, 2011|