geronimocastano/typed-dsa — explained in plain English
Analysis updated 2026-05-18
Draw a binary search tree or AVL tree diagram for a lecture note by calling one function with your values.
Generate a step-by-step trace of a sorting algorithm like quick sort or merge sort for a problem set.
Visualize graph algorithms like breadth first search and Dijkstra with automatic node and edge highlighting.
| geronimocastano/typed-dsa | auser/resume | moritzheiber/briefvorlage | |
|---|---|---|---|
| Stars | 14 | — | — |
| Language | Typst | Typst | Typst |
| Last pushed | — | 2026-05-26 | 2026-06-24 |
| Maintenance | — | Maintained | Active |
| Setup difficulty | easy | moderate | moderate |
| Complexity | 2/5 | 2/5 | 2/5 |
| Audience | writer | pm founder | pm founder |
Figures from each repo's GitHub metadata at analysis time.
typed-dsa is a package for Typst, a modern typesetting language often used to write documents like lecture notes and academic papers. This tool lets you draw diagrams of data structures such as trees, heaps, linked lists, stacks, queues, hash tables, arrays, matrices, and graphs directly inside a Typst document, using code instead of manually placing shapes by hand. You call a builder function with the values you want to show, and it returns an object with a diagram field you can display in your document. For example, calling the tree builder with a list of numbers produces a binary search tree diagram, and calling the heap builder produces a heap diagram. All diagrams share consistent styling and are built on top of a Typst graphics package called CeTZ. Beyond static pictures, typed-dsa can also show operations happening step by step. Insert a value into a binary search tree or an AVL tree and you get the before and after states, plus a label describing what changed. Graph algorithms like breadth first search, depth first search, and Dijkstra's shortest path produce full traces showing which nodes were visited, which node is current, and which edge is being checked, with distances labeled as the algorithm progresses. Sorting algorithms such as merge sort, quick sort, bubble sort, insertion sort, and selection sort generate full teaching traces automatically, so you can display an entire algorithm run or pick out individual steps. The intended use case is teaching material: lecture notes, problem sets, and explanations where the shape of a data structure matters more than manually positioning every element on the page. Every builder accepts styling options, and structure specific style helpers exist for trees, stacks, and graphs, letting an instructor keep a consistent look across many diagrams. The project is written for the Typst ecosystem rather than a general purpose programming language, so it is most useful to someone already writing documents in Typst who wants to illustrate computer science concepts without hand drawing every node and arrow.
A Typst package that draws data structure diagrams, like trees, heaps, and graphs, plus step-by-step sorting and algorithm traces, from short code calls.
Mainly Typst. The stack also includes Typst, CeTZ.
Setup difficulty is rated easy, with roughly 5min to a first successful run.
Mainly writer.
This repo across BitVibe Labs
double-check against the repo, no cap.