Clone Graph

Pacific Atlantic Water Flow

Reorder List

Deep-copy a connected graph from its adjacency-list representation.

Given a 1-indexed undirected graph as adjacency rows, return an independent adjacency-list copy with the same neighbor order.

## Example
```json
Input: {"adjacency":[[2,4],[1,3],[2,4],[1,3]]}
Output: [[2,4],[1,3],[2,4],[1,3]]
```

## Constraints
- 0 <= number of nodes <= 100
- No duplicate neighbors or self-loops

## Follow-up
In a node-object implementation, why must the clone map be filled before recursing?

The key pattern is: DFS copies each vertex and adjacency row once. Identify the state and invariant before coding.

Recognize the Pattern

Advance one state transition at a time. Mark or update state before exploring dependent work.

Build the Algorithm

Test empty or minimal input, skewed shapes, duplicates where allowed, and impossible outcomes.