<｜begin▁of▁sentence｜>### Instruction:
Imagine you're working with a professional athlete who's keen on analyzing their progress through a network of training milestones. You've outlined their journey with a milestone map, which is essentially a directed graph with connections from one milestone to the next. Right now, your milestone map looks like a sequence of progressions: from the first milestone (1) to the second (2), then from (2) to (3), and finally from (3) to (4).

But to get a more holistic view of the athlete's progress, you're interested in seeing this map as a web of interconnected milestones, without any particular direction—from any milestone, the athlete can see how they are linked to the others. How would you use NetworkX to reconfigure your directed milestone map so that it appears as a non-directed network, and could you demonstrate the interconnectedness by showing the paired links between these milestones?
### Response:
import networkx as nx

# Create a directed graph
DG = nx.DiGraph()
DG.add_edges_from([(1, 2), (2, 3), (3, 4)])

# Get an undirected view of the graph
UG = DG.to_undirected()

# Print edges of the undirected graph
print('Undirected Edges:', list(UG.edges()))
<|EOT|>
