<｜begin▁of▁sentence｜>### Instruction:
Given a weighted complete graph created using NetworkX's cycle_graph function with 5 nodes and one edge (between nodes 1 and 2) having a higher weight (10), can you find an approximate minimal path that visits all the nodes without returning to the starting node using the NetworkX's traveling_salesman_problem function?
### Response:
import networkx as nx

# Create a complete graph
G = nx.cycle_graph(5)
G[1][2]['weight'] = 10  # set a higher weight for edge (1, 2)

# Find the approximate minimal path through the nodes
path = nx.approximation.traveling_salesman_problem(G, cycle=False)
print('Traveling Salesman path:', path)
<|EOT|>
