<｜begin▁of▁sentence｜>### Instruction:
As a digital marketing manager, you've been tasked with optimizing the online presence of a new product. Utilizing networkx, you need to identify and remove any redundant digital marketing channels to ensure an efficient and effective online marketing strategy. This involves finding the most impactful channels and minimizing any potential redundancy by using the Eades' heuristic method to minimize the total investment while maintaining the product's reach.
### Response:
from igraph import GraphBase

# Create a graph with 5 vertices and a cycle
edges = [(0, 1), (1, 2), (2, 3), (3, 0), (3, 4)]
weights = [1, 1, 1, 1, 10]
directed_graph = GraphBase(edges=edges, directed=True)

# Get the feedback arc set using Eades' heuristic
feedback_arc_set = directed_graph.feedback_arc_set(weights=weights, method='eades')

# Remove the edges from the feedback arc set
for edge in feedback_arc_set:
    directed_graph.delete_edges(edge)

print('Removed edges:', feedback_arc_set)
<|EOT|>
