<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph reading from an edge list, can you use the feedback_arc_set function from igraph to calculate and remove the edges that form the feedback arc set using the 'eades' method, and then print the remaining edges of the acyclic graph?
### Response:
from igraph import Graph

# Create a directed graph
edges = [(0, 1), (1, 2), (2, 3), (3, 1)]
g = Graph(edges=edges, directed=True)

# Calculate the feedback arc set using the 'eades' method
feedback_arc_set = g.feedback_arc_set(weights=None, method='eades')

# Remove the edges from the graph
g.delete_edges(feedback_arc_set)

# Print the remaining edges
print(g)
<|EOT|>
