Interactive Step-by-Step
01

Setup Graph

Enter 0 or 1 in each cell. Diagonal = self-loop.

02

Adjacency Matrix

Build the graph first.

03

Reachability Matrix

Run the algorithm to see results.

Graph Visualization

Original Discovered Active path

Algorithm Controls

Ready Build a graph and run the algorithm