<｜begin▁of▁sentence｜>### Instruction:
Given a graph with edge set [('A', 'B', 2), ('C', 'D', 3), ('D', 'C', -5), ('B', 'C', 1), ('C', 'A', -8)], does it contain a negative edge weight cycle?
### Response:
import networkx as nx

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

# Add edges with weights
e = [('A', 'B', 2), ('C', 'D', 3), ('D', 'C', -5), ('B', 'C', 1), ('C', 'A', -8)]
G.add_weighted_edges_from(e)

# Check for existence of negative edge cycle
has_cycle = nx.negative_edge_cycle(G)
print('Graph has a negative edge cycle:', has_cycle)
<|EOT|>
