Reincodes
Portfolio & DSA Visualizer

Edge List
Adjacency List
  • 0
    ->
    1
  • 1
    ->
    0
    2
    3
    4
  • 2
    ->
    1
    4
    5
  • 3
    ->
    1
    5
  • 4
    ->
    1
    2
  • 5
    ->
    2
    3
    6
  • 6
    ->
    5
Traversals:
BFS|DFS
Number of components in undirected graph:1
Is Graph a Valid Tree (No cycle & all nodes are connected)?:No
Sample graphs:
graph w/ 1 componentgraph w/ 2 component