<｜begin▁of▁sentence｜>### Instruction:
As a policy analyst, when considering the impact of public policies and proposals, it is important to identify any instances where the same policy or proposal has been duplicated or repeated. In the context of a graph with edges, it would be necessary to determine which edges are multiple edges, as this can impact the overall structure and efficiency of the network. For instance, in a transportation network, identifying multiple edges between the same two nodes could indicate redundant or duplicate routes, which may require further evaluation to optimize the network's functionality.
### Response:
import igraph as ig

# Create a graph with multiple edges
g = ig.Graph([(0, 1), (1, 2), (2, 3), (3, 0), (1, 2)])

# Check for multiple edges
multiple_edges = g.is_multiple()

# Print the list indicating which edges are multiples
print(multiple_edges)
<|EOT|>
