Graphs
BFS/DFS, Dijkstra, A*, Bellman-Ford, and MST (Prim/Kruskal). Visualize directed/undirected, weighted/unweighted graphs.
- Shortest paths and heuristics
- Topological sorting (DAGs)
- Import/Export and presets
1. Graph Type
2. Direction
3. Build & Edit
Double-click a node to edit its value.
4. Set Points
5. Choose Algorithm
6. Run & Control
Select 'Add Node' to begin.
Pseudocode
Data Structure
1. Choose Algorithm
2. Configure
3. Run
Pseudocode
Stack (LIFO)
Top at the top. Latest element has TOP badge.
Queue (FIFO)
Front on the left. First element has FRONT badge. Rear grows to the right.
Notes
Stack: LIFO structure. Operations: push, pop, peek.
Push: O(1), Pop: O(1), Peek: O(1)
Queue: FIFO structure. Operations: enqueue, dequeue, front.
Enqueue: O(1), Dequeue: O(1), Front: O(1)
Animation Speed
Operation Log
Code Snippet
// Perform an operation to see code...