<｜begin▁of▁sentence｜>### Instruction:
As a transportation planner, you have been tasked with evaluating the efficiency of a city's transportation network. The edge set provided represents the connections between different transportation hubs within the city. In order to assess the network's simplicity and streamline the transportation system, you have been asked to check if the graph is simple, meaning it does not contain any loops or multiple edges. To accomplish this, you have the capability to use the is_simple function in the igraph API.
### Response:
from igraph import Graph

# Create a graph with potential loop and multiple edges
g = Graph(edges=[(0, 1), (1, 2), (2, 0), (0, 0), (1, 1), (0, 1)])

# Check if the graph is simple
is_simple_graph = g.is_simple()

# Print result
print('The graph is simple:', is_simple_graph)
<|EOT|>
