<｜begin▁of▁sentence｜>### Instruction:
Imagine you're working as a web developer, and you've been tasked with crafting an interactive feature for a networking education platform that visually demonstrates the concept of graph complements. You're provided with a dataset defining the relationships in a small network: the edge set is represented as [(1, 2), (1, 3), (2, 3), (3, 4), (3, 5)].

Your current challenge is to develop a script using NetworkX that will determine the edges of the complement of the given network graph. The complement should then be displayed visually on the platform. How would you structure your code to generate the set of edges that would connect all non-adjacent nodes in the complement of the original graph?
### Response:
import networkx as nx

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

# Get the complement of the graph
G_complement = nx.complement(G)

# Print the edges of the complement graph
print('Edges of the complement graph:', G_complement.edges())
<|EOT|>
