Random Graph

Sample Graphs

Directed <-> Undirected

BFS

DFS

Cut Vertex & Bridge

SCC Algorithms

Bipartite Graph check

Topo Sort

Two-SAT checker

slowfast

In the Graph-Traversal problem, we mainly use DFS (Depth-First-Search) and BFS (Breadth-Frist-Search) to travel the graph.

We also mention about a lot of DFS and BFS variants such as cut vertex, bridge and SCC algorithms, ...

We also mention about a lot of DFS and BFS variants such as cut vertex, bridge and SCC algorithms, ...

Next

Choose a sample graph and try running the different algorithms on it:

The basis O(n) DFS and BFS

The O(n) cut vertex and bridge algorithm

The scc algorithms

The bipartite graph checker

The topological sort algorithms

And the two-sat checker algorithm

...

The basis O(n) DFS and BFS

The O(n) cut vertex and bridge algorithm

The scc algorithms

The bipartite graph checker

The topological sort algorithms

And the two-sat checker algorithm

...

Next

When the algorithm is running, the animation will be show here.

Next

The status bar explains the execution of the algorithm at each animation step.

Next

You can also follow the psuedocode highlights to trace the algorithm.

Next

Control the animation with the player controls! Keyboard shortcuts are:

**Spacebar:** play/pause/replay
**Left/right arrows:** step backward/step forward

**-/+:** decrease/increase speed

Next

Return to "Exploration Mode" to start exploring!