<｜begin▁of▁sentence｜>### Instruction:
{'description': 'Consider a graph with edges [(0, 1), (1, 2), (2, 3), (3, 0), (1, 3)]. Using NetworkX, determine if the graph is semi-Eulerian, which means it should have an Eulerian path but no Eulerian circuit.', 'problem': 'Determine if a given undirected graph is semi-Eulerian using the is_semieulerian function from NetworkX.'}
### Response:
import networkx as nx

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

# Check if the graph is semi-Eulerian
is_semi = nx.is_semieulerian(G)
print('Is the graph semi-Eulerian?', is_semi)
<|EOT|>
