<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with a cycle, can you identify and remove a minimum set of edges to make the graph acyclic using the NetworkX library?
### Response:
import networkx as nx

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

# Calculate the feedback arc set using NetworkX
fas = nx.minimum_feedback_arc_set(G)

# Print the feedback arc set
print(f'Feedback arc set: {fas}')

# Remove the feedback arc set to make the graph acyclic
G.remove_edges_from(fas)

# Check if the graph is now acyclic
print(f'Is acyclic: {nx.is_directed_acyclic_graph(G)}')
<|EOT|>
