<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with the edge set [(0, 1), (0, 2), (2, 3), (3, 4)], can you check if the graph is an arborescence using NetworkX?
### Response:
import networkx as nx

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

# Check if the graph is an arborescence
is_arbo = nx.is_arborescence(G)
print('Is the graph an arborescence?', is_arbo)
<|EOT|>
