Skip to main content
100%

Gist b9e14cdd96682d931acd2ff1e0c5502e

✓ Published0🌍 Public
Aakeshavan
Last edited Oct 16, 2016
Created on Oct 16, 2016

This notebook demonstrates recursive tree algorithms implemented in Python, defining functions to square tree values, compute height, find maximum values, locate paths, prune branches, and generate hailstone sequences. The code uses a custom `tree` representation as nested lists, with helper functions like `root`, `branches`, and `is_leaf` to navigate the structure. Each algorithm follows a consistent pattern of processing the root, checking for leaf nodes, recursing over branches, and returning the final result. The examples illustrate functional decomposition and recursion for hierarchical data manipulation, with no external visualization libraries involved.

AI-generated description

Similar vizzes

Loading thumbnail…

Recursive depth-first search

This example demonstrates a recursive depth-first search through a tree of Node objects, where each node holds a value and a list of children. The search traverses the tree from the root downward, checking each node’s value and recursively exploring children until a match is found, returning the target node or None. The code builds a sample tree with letters (a through h) and prints the result of searching for 'g', using plain Python classes and methods like `get_value()` and `get_children()`. No external visualization libraries are used; the output is text-based, showing the found node.

Aantonyross
64% match
Loading thumbnail…

jack_jill_nested_calls

This example visualizes a nested sequence of function calls as a branching tree layout, where each call—such as `went_up`, `fetch`, and `tumble_after`—appears as a node with its arguments as child branches. It shows the hierarchical flow of a story’s actions, with the root call `tumble_after` at the top and leaf nodes like `jack_jill` and `"hill"` at the bottom. The code uses `d3.forceSimulation` to position nodes and `d3.linkHorizontal` for curved edges, while the data is a hardcoded JavaScript object representing the call tree. Rendering is done with SVG paths and circles, styled via `d3.select` and `attr`.

Aadiamaan92
61% match
Loading thumbnail…

Tree Traversals

This interactive visualization demonstrates depth-first and breadth-first tree traversal algorithms on a small dummy dataset. Two buttons trigger the respective traversals, animating each visited node by coloring it red in sequence, while a reset button restores the original white and steel-blue styling. The tree is rendered as a static D3 dendrogram using `d3.layout.tree`, with nodes and links drawn as SVG circles and lines. The animations are driven by chained `transition().style()` calls with incremental delays, and the traversal logic itself relies on basic JavaScript array operations—a stack for depth-first and a queue for breadth-first.

PPooky2011
60% match
Loading thumbnail…

Gist 13007f773bff03dcdb4117a57b9387c1

This example demonstrates a depth-first search algorithm traversing a small graph represented as a Python dictionary, with sets of neighboring nodes as values. It shows how the search visits nodes from a starting point toward a goal, collecting visited nodes into a set and returning the traversal path when the goal is reached. The code uses plain Python data structures and recursion, with no external visualization libraries. The graph’s six nodes (A through F) and their edges are hardcoded, and the algorithm prints the set of visited nodes upon success, while returning `False` if no path exists.

Aaarsenault
60% match
Loading thumbnail…

Tree Example

This interactive tree diagram displays a hierarchical dataset with a single root node and two levels of children. Clicking any parent node collapses its subtree, and clicking again expands it. The visualization is built with D3.js version 3.5.17, using `d3.layout.tree` and `d3.svg.diagonal` to compute and draw the layout as SVG elements. Animated transitions, controlled by `node.transition` and a 750-millisecond duration, smoothly move nodes and links between states. The example is adapted from Mike Bostock’s collapsible tree and uses hardcoded JavaScript data.

Dd3noob
60% match
Loading thumbnail…

Gist b64124620bd851544b8e9e87b16370e8

This Jupyter notebook demonstrates how to define a curried `multiadder` function in Python, where `multiadder(n)` returns a chain of functions that each accept one argument and accumulate a sum. The code shows two implementations: a first pass using a dummy total variable, and a refined version that returns nested functions to handle the summation. Example calls like `multiadder(5)(1)(1)(1)(1)(1)` output `5`, and `multiadder(2)(4)(5)` returns `9`, illustrating the incremental function-returning behavior. The notebook uses standard Python 2 syntax, with code cells and Markdown explanations, and outputs results directly as text.

Aakeshavan
60% match
Loading thumbnail…

Code searches a Tree of nodes, depth-first

This example visualizes a depth-first search of a tree, showing the search path as nodes are visited and discarded. It uses a custom Node class in Python to build the tree structure, with each node holding a value and a list of children. The dfs function traverses the tree using a stack, popping nodes to check their values and printing each visited node to display the search order. The code defines two sample trees and searches for a specific target value, demonstrating how the algorithm explores branches before backtracking.

Aantonyross
60% match
Loading thumbnail…

Gist 2c4e1c0d19a9894cfe93

This example visualizes the inheritance chain of Python classes as a small, static diagram. It shows the relationship between a base class `Bob` and its subclass `Sid`, with the inherited attribute `hello` displayed on both. The visualization uses a simple tree-like layout, with class names as nodes and connecting lines to indicate the parent-child relationship. The rendering is done through a custom Python script that likely uses a basic drawing library, but the code itself primarily demonstrates the class definitions and attribute access, rather than any specific visualization API.

Aandybak
59% match