<｜begin▁of▁sentence｜>### Instruction:
Certainly! Imagine we're conceptualizing the layout for a fashion show, where the runway segments are represented by connections between various stages, or "nodes," at which models pause to showcase our latest collection. Our setup is currently sketched as follows: there's a sleek catwalk path from stage 1 to stage 2 and another from stage 1 to stage 3. Then, we have a spotlighted walk leading from stage 3 to stage 4 and finally an exclusive segment stretching from stage 4 to stage 5.

As we're optimizing the model's journey to ensure they can gracefully traverse from the opening stage 1 to the grand finale at stage 5, we need to consider if the current runway design allows for a seamless stride all the way through. In the context of our planning, can we verify that there's a connected path within our stages that would allow a model to start at stage 1 and conclude their journey at stage 5 without any interruptions or detours?
### Response:
import networkx as nx

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

# Use has_path to check if there is a path between node 1 and 5
path_exists = nx.has_path(G, source=1, target=5)

print('Is there a path between node 1 and 5?', path_exists)
<|EOT|>
