<｜begin▁of▁sentence｜>### Instruction:
Given a graph whose edge set is [(0, 1), (1, 2), (2, 3)], can you use the 'number_of_walks' function in NetworkX to compute the number of walks of length 3 between all pairs of nodes?
### Response:
import networkx as nx

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

# Calculate the number of walks of length 3
walk_length = 3
walks = nx.number_of_walks(G, walk_length)
print(walks)
<|EOT|>
