求解最大连通子图

2023-09-15 阅读 20 评论 0

摘要：使用networkx里面的函数来求解最大连通子图 # -*- coding: utf-8 -*- """ Created on Wed Mar 11 21:38:53 2020@author: Administrator """import matplotlib.pyplot as plt import networkx as nxdef get_connected_components():G = nx.Gr

使用networkx里面的函数来求解最大连通子图

# -*- coding: utf-8 -*-
"""
Created on Wed Mar 11 21:38:53 2020@author: Administrator
"""import matplotlib.pyplot as plt
import networkx as nxdef get_connected_components():G = nx.Graph()filestr = ""with open("matrix.txt") as files:for line in files:filestr += line.strip()#将字符串转换成列表matrix = eval(filestr)nodes = range(len(matrix))G.add_nodes_from(nodes)for i in range(len(matrix)):for j in range(len(matrix)):if(matrix[i][j] == 1):G.add_edge(i, j)#计算一个图的最大连通子图 max_cc =max(nx.algorithms.components.connected_components(G),key = len)print(max_cc)print("-----------------该网络的节点总数为----------------------")print(len(matrix))print("----------------最大连通分支包含的节点个数----------------")ncc = float(len(max_cc))print(ncc)print("---------------------最大连通分支比例--------------------")print(ncc/len(matrix))get_connected_components()

在这里插入图片描述