<｜begin▁of▁sentence｜>### Instruction:
Given a simple undirected graph with nodes labeled sequentially starting from 0, and edges creating a square (0-1-2-3-0), how can you access and display the neighbors of each node using the networkx.classes.coreviews.adjacencyview?
### Response:
import networkx as nx

# Create a graph
G = nx.Graph()
G.add_edges_from([(0, 1), (1, 2), (2, 3), (3, 0)])

# Access the adjacency view
adjacency_view = G.adjacency()

# Iterate through the adjacency view
for node, neighbors in adjacency_view:
    print(f'Node {node} has neighbors: {list(neighbors.keys())}')
<|EOT|>
