If an undirected graph with 4 vertices is stored in a 1-D array
If an undirected graph with 4 vertices is stored in a 1-D array `G[]` as the following:
```
G[] = { 0, 1, 0, 1, 1, 0, 0, 0, 1, 0 }
```
Then there exists an edge between vertex 2 and vertex 0. ~@[](2)答案：TRUE