Simulator
Edit graph
Vertices
V = {A, B, C, D}
- A
- B
- C
- D
Edges
E = {{A, B}, {A, C}}
- {A, B}
- {A, C}
Graph
4 vertices · 2 edgesRepresentation
Neighbor lists
- A{B, C}
- B{A}
- C{A}
- D∅
Connected components
2- C1{A, B, C}
- C2{D}
Simple cycles
0No cycles in this graph.