git404hub

what is typed-dsa fr?

geronimocastano/typed-dsa — explained in plain English

Analysis updated 2026-05-18

14TypstAudience · writerComplexity · 2/5Setup · easy

tl;dr

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.

vibe map

mindmap
  root((typed-dsa))
    What it does
      Draws data structure diagrams
      Built on CeTZ
      Runs inside Typst documents
    Structures
      Trees and heaps
      Linked lists and queues
      Graphs and hash tables
    Operations
      Insert delete search traces
      Sorting algorithm traces
      Graph algorithm traces
    Use cases
      Lecture notes
      Problem sets
      Teaching explanations

Code map

Detail Auto

An interactive map of this repo's files and how they connect — its source is parsed live in your browser. Click Visualize to build it.

filefunction / class

what do people make with this?

VIBE 1

Draw a binary search tree or AVL tree diagram for a lecture note by calling one function with your values.

VIBE 2

Generate a step-by-step trace of a sorting algorithm like quick sort or merge sort for a problem set.

VIBE 3

Visualize graph algorithms like breadth first search and Dijkstra with automatic node and edge highlighting.

what's the stack?

TypstCeTZ

how it stacks up fr

geronimocastano/typed-dsaauser/resumemoritzheiber/briefvorlage
Stars14
LanguageTypstTypstTypst
Last pushed2026-05-262026-06-24
MaintenanceMaintainedActive
Setup difficultyeasymoderatemoderate
Complexity2/52/52/5
Audiencewriterpm founderpm founder

Figures from each repo's GitHub metadata at analysis time.

how do i run it?

Difficulty · easy time til it works · 5min

in plain english

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.

prompts (copy fr)

prompt 1
Show me how to use typed-dsa to draw a binary search tree with the values 50, 30, 70, 20, 40 in a Typst document.
prompt 2
Write a Typst snippet using typed-dsa to generate a step-by-step bubble sort trace for the array 5, 1, 4, 2.
prompt 3
Using typed-dsa, create a graph diagram with a linear layout showing a topological ordering.
prompt 4
Help me style a typed-dsa heap diagram by changing its colors with the style option.

Frequently asked questions

what is typed-dsa fr?

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.

What language is typed-dsa written in?

Mainly Typst. The stack also includes Typst, CeTZ.

How hard is typed-dsa to set up?

Setup difficulty is rated easy, with roughly 5min to a first successful run.

Who is typed-dsa for?

Mainly writer.

peek the repo → explain another one

This repo across BitVibe Labs

double-check against the repo, no cap.