我正在過(guò)濾邊的子集，以便可以遍歷它們。在這種情況下，我排除了“末端邊緣”，它們是沿鏈的最終邊緣：import networkx as nxgraph = nx.Graph()graph.add_edges_from([(0, 1), (1, 2), (2, 3), (3, 4)])end_nodes = [n for n in graph.nodes if nx.degree(graph, n) == 1]end_edges = graph.edges(end_nodes)print(f"end edges: {end_edges}")for edge in graph.edges:    if edge not in end_edges:        print(f"edge {edge} is not an end edge.")    else:        print(f"edge {edge} is an end edge.")但是，當(dāng)您運(yùn)行此代碼時(shí)，您會(huì)得到以下輸出：end edges: [(0, 1), (4, 3)]edge (0, 1) is an end edge.edge (1, 2) is an end edge.edge (2, 3) is an end edge.edge (3, 4) is an end edge.Edges (1, 2)and (2, 3)are not in end_edges，但它在檢查False條件時(shí)返回edge not in end_edges（似乎暗示它實(shí)際上被包含，而它似乎不包含）。發(fā)生了什么事，我該如何正確過(guò)濾？Python 版本是 3.7，NetworkX 是 2.4。