<｜begin▁of▁sentence｜>### Instruction:
Given a graph with the edge set [(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 the node 0? If there is no negative cycle, it should inform the user accordingly.
### Response:
import networkx as nx

# Create 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)])

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