Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Redundant Connection
Bookmark
DFS Cycle Detection
Union Find
Input
Triangle
Square with extra
Hexagon
Custom
edges
=
[[1,2],[1,3],[2,3]]
Input Graph
1
2
3
DFS Search
Stack:
empty
Visited:
empty
Legend:
Unreached
Reached
Expanding
Redundant
Input Graph
1
2
3
DFS Search
Stack:
empty
Visited:
empty
Legend:
Unreached
Reached
Expanding
Redundant
Input Graph
1
2
3
DFS Search
Stack:
empty
Visited:
1
Legend:
Unreached
Reached
Expanding
Redundant
Input Graph
1
2
3
DFS Search
Stack:
empty
Visited:
empty
Legend:
Unreached
Reached
Expanding
Redundant
Input Graph
1
2
3
DFS Search
Stack:
empty
Visited:
1
Legend:
Unreached
Reached
Expanding
Redundant
Input Graph
1
2
3
DFS Search
Stack:
empty
Visited:
1
2
Legend:
Unreached
Reached
Expanding
Redundant
Input Graph
1
2
3
DFS Search
Stack:
empty
Visited:
empty
Legend:
Unreached
Reached
Expanding
Redundant
Input Graph
1
2
3
DFS Search
Stack:
empty
Visited:
2
Legend:
Unreached
Reached
Expanding
Redundant
Input Graph
1
2
3
DFS Search
Stack:
empty
Visited:
1
2
Legend:
Unreached
Reached
Expanding
Redundant
Input Graph
1
2
3
DFS Search
Stack:
empty
Visited:
1
2
3
Legend:
Unreached
Reached
Expanding
Redundant
Input Graph
1
2
3
DFS Search
Stack:
empty
Visited:
empty
Legend:
Unreached
Reached
Expanding
Redundant
algo
master
.
io
Step:
Start from an empty graph over 3 nodes
0 / 35
Input
Triangle
Square with extra
Hexagon
Custom
edges
=
[[1,2],[1,3],[2,3]]
0 / 35
algo
master
.
io
Step:
Start from an empty graph over 3 nodes
