Note: This is an archvied version of our old webpage. Some links might be broken. The current one can be found here.

Binary Decision Diagrams

This is obst, a visualisation of algorithms related to Binary Decision Diagrams, written by Philipp Czerner in 2018.

Read the help for more information, or get started right away by pressing “Create and add”.

Hint: You can hover over nodes using your cursor, showing additional details.

Input type:
Base:Bit order:

Adds the BDD to the graph.

Operation:
First node:

Second node:

Applies the operation.

Reset the application, delete all nodes.

Display usage instructions.

Step-by-step(Move using arrow keys)

0/0

Loading...

About

obst visualises algorithms related to Binary Decision Diagrams (BDDs). BDDs are a data structure one can use to represent sets of numbers in a concise and unique fashion, while still being able to efficiently execute set operations on them.

In particular, this tool shows how to create a BDD from a list of numbers, as well as compute their union, intersection and complement. The source is publicly available on GitHub. Feel free to write me an email for any feedback, suggestions, etc.!

Usage Instructions

Press “Create and add” to get started. This will add a BDD to the graph representing the set of numbers you specified. Afterwards you can step through the frames of the animation (using arrow keys, or the buttons labelled “<” and “>”).

Once the graph contains some nodes, you can start doing set operations. Simply enter the names of the nodes and press the “Calculate” button. Once again, you can go through the frames of the animation to find out how exactly the result was computed.

Keybindings

Left, Right: Move to the previous/next frame of the animation.

Page down, Page up: Move to the previous/next checkpoint, that is the first frame of an operation.