Graph Manipulation

Clone Graph

Create a Deep Copy of a graph where every node and edge is a new object in memory. We use a reference map to track correspondence during DFS traversal.

Time ComplexityO(V + E)

Memory PatternDeep Copy

Start Interactive Simulator

Deep vs Shallow

A shallow copy only copies references. A deep copy (cloning) creates entirely new objects so changes to one don't affect the other.

Mapping Table

The core is a Map<OriginalNode, ClonedNode>. This prevents infinite cycles and ensures nodes are only cloned once.

Original Graph

🖱️ Click Canvas: Add Node • ↔️ Drag: Move • ⌨️ Shift+Click: Join

Cloned Memory

Loading Lab...

Graph Manipulation

Clone Graph

Create a Deep Copy of a graph where every node and edge is a new object in memory. We use a reference map to track correspondence during DFS traversal.

Time ComplexityO(V + E)

Memory PatternDeep Copy

Start Interactive Simulator

Deep vs Shallow

A shallow copy only copies references. A deep copy (cloning) creates entirely new objects so changes to one don't affect the other.

Mapping Table

The core is a Map<OriginalNode, ClonedNode>. This prevents infinite cycles and ensures nodes are only cloned once.

Original Graph

🖱️ Click Canvas: Add Node • ↔️ Drag: Move • ⌨️ Shift+Click: Join

Cloned Memory