我不确定你想要什么,因为在标题中你要求有序边缘,但在你的示例中你要求边缘中的节点有序。在我的示例中,我展示了两者的排序。请注意,我使用列表推导式创建新的边缘列表 -- 原始的边缘列表 (some_edges
) 不会改变。
首先是如何对边缘列表中的单个节点元组进行排序。也就是说,边缘按照相同的顺序排列,但其中的节点被排序。
import networkx as nx
g = nx.Graph()
g.add_edges_from([
(5, 2),
(2, 1),
(3, 2),
(4, 2)
])
some_edges = g.edges(2)
print("Not sorted: ", some_edges)
print("SORTED")
some_edges_1 = [tuple(sorted(edge)) for edge in some_edges]
print("Sorted nodes:", some_edges_1)
现在讲解如何对边列表进行排序。
some_edges_2 = sorted(some_edges_1)
print("Sorted edges:", some_edges_2)
上述两个代码块的输出结果:
Not sorted: [(2, 1), (2, 3), (2, 4), (2, 5)]
SORTED
Sorted nodes: [(1, 2), (2, 3), (2, 4), (2, 5)]
Sorted edges: [(1, 2), (2, 3), (2, 4), (2, 5)]
这里还有一个反向排序的例子,您可以看到对单个边进行排序和对边列表进行排序之间的区别。
print("Not sorted: ", some_edges)
print("SORTED REVERSE")
some_edges_1 = [tuple(sorted(edge, reverse=True)) for edge in some_edges]
print("Sorted nodes:", some_edges_1)
some_edges_2 = sorted(some_edges_1, reverse=True)
print("Sorted edges:", some_edges_2)
输出:
Not sorted: [(2, 1), (2, 3), (2, 4), (2, 5)]
SORTED REVERSE
Sorted nodes: [(2, 1), (3, 2), (4, 2), (5, 2)]
Sorted edges: [(5, 2), (4, 2), (3, 2), (2, 1)]