使用igraph python查找图的巨型分量的直径和平均最短路径长度

import igraph as ig

g = ig.Graph()

g.add_vertices(5)  # 添加5个节点
g.add_edges([(0, 1), (1, 2), (2, 3), (3, 4), (4, 0)])  # 添加边

clusters = g.clusters()
giant_component = clusters.giant()  # 获取巨型分量

diameter = giant_component.diameter()  # 计算直径
avg_path_length = giant_component.average_path_length()  # 计算平均最短路径长度

import igraph as ig

g = ig.Graph()
g.add_vertices(5)
g.add_edges([(0, 1), (1, 2), (2, 3), (3, 4), (4, 0)])

clusters = g.clusters()
giant_component = clusters.giant()

diameter = giant_component.diameter()
avg_path_length = giant_component.average_path_length()

print("巨型分量的直径：", diameter)
print("巨型分量的平均最短路径长度：", avg_path_length)