PPolySim OS
Use case · powered by Graph Traversal

Graph Traversal for a game tree

Simulate a game tree live in your browser. This runs the real Graph Traversal solver — adjust the inputs, watch it respond instantly, and export the result. No install, no account.

Graph Traversal (BFS / DFS)Live

Controls

The two ways to explore a graph. Breadth-first search fans out level by level using a queue, visiting all near nodes before far ones — ideal for shortest paths. Depth-first search plunges as deep as possible using a stack, backtracking when stuck — ideal for cycle detection and topological sorting. Watch the numbered visit order differ.

▶ Run in Python

Data Inspector

ModeBFS
Structurequeue (FIFO)
Nodes9

Governing equation

Reading this result: BFS uses a FIFO queue, so it fully visits every node at distance 1 before any at distance 2 — that level-by-level order is exactly why it finds shortest paths in unweighted graphs.

Runs locally in your browser — free forever. Scale to the cloud when reality gets heavy.

or unlock everything with Pro →

About this simulation

The full Graph Traversal tool models a game tree with the same numerics engineers and scientists use — running entirely client-side. Change any parameter and the result updates in real time, so you can build intuition, check a design, or teach the concept without spreadsheets or installs.

More you can do with Graph Traversal

Other ways to simulate a game tree

Frequently asked questions

How do I simulate a game tree?
Open this page and use the live Graph Traversal tool below — set your inputs and the simulation runs instantly in your browser using real numerics. No install, no account needed.
Is it free?
Yes. The simulation runs free in your browser. A one-time unlock or a Pro plan adds advanced parameters, saved presets, data import, and clean exports.
Can I use my own numbers?
Absolutely — every input is adjustable, and with data import you can drive a game tree from your own measurements.