<｜begin▁of▁sentence｜>### Instruction:
Given a graph with weighted edges [(0, 1, 2), (1, 2, 2), (2, 0, 1), (1, 4, 2), (4, 0, -5)], can you find a negative cycle using NetworkX starting from node 0?
### Response:
import networkx as nx

# Initialize a directed graph
G = nx.DiGraph()

# Add weighted edges
G.add_weighted_edges_from([(0, 1, 2), (1, 2, 2), (2, 0, 1), (1, 4, 2), (4, 0, -5)])

# Try to find a negative cycle starting from node 0
try:
    cycle = nx.find_negative_cycle(G, 0)
    print('Negative cycle found:', cycle)
except nx.NetworkXError as e:
    print('No negative cycle found:', e)
<|EOT|>
