<｜begin▁of▁sentence｜>### Instruction:
Given a graph with the edge set [('A', 'B'), ('A', 'C'), ('B', 'C'), ('C', 'D'), ('D', 'E'), ('E', 'F'), ('F', 'A')], can you use the NetworkX function 'find_asteroidal_triple' to check if the graph contains an asteroidal triple or not?
### Response:
import networkx as nx

# Create a graph
G = nx.Graph()
G.add_edges_from([('A', 'B'), ('A', 'C'), ('B', 'C'), ('C', 'D'), ('D', 'E'), ('E', 'F'), ('F', 'A')])

# Find an asteroidal triple
asteroidal_triple = nx.find_asteroidal_triple(G)

# Output the result
if asteroidal_triple:
    print('Asteroidal triple found:', asteroidal_triple)
else:
    print('No asteroidal triple found. The graph is AT-free.')
<|EOT|>
