python数据结构包括什么_Python中最有效的图形数据结构是什么？

我强烈建议你NetworkX...。这是经过测试的，也是大多数“研究”类型在需要分析基于网络的数据时所使用的第一个工具。我在笔记本电脑上操作了100个数千边的图形，没有问题。它的功能丰富，非常容易使用。您会发现自己更多地关注眼前的问题，而不是底层实现中的细节。

例ERD-Rényi随机图生成与分析"""

Create an G{n,m} random graph with n nodes and m edges

and report some properties.

This graph is sometimes called the Erd##[m~Qs-Rényi graph

but is different from G{n,p} or binomial_graph which is also

sometimes called the Erd##[m~Qs-Rényi graph.

"""

__author__ = """Aric Hagberg (hagberg@lanl.gov)"""

__credits__ = """"""

# Copyright (C) 2004-2006 by

# Aric Hagberg

# Dan Schult

# Pieter Swart

# Distributed under the terms of the GNU Lesser General Public License

# http://www.gnu.org/copyleft/lesser.html

from networkx import *

import sys

n=10 # 10 nodes

m=20 # 20 edges

G=gnm_random_graph(n,m)

# some properties

print "node degree clustering"

for v in nodes(G):

print v,degree(G,v),clustering(G,v)

# print the adjacency list to terminal

write_adjlist(G,sys.stdout)

可视化也很简单：

二次

二次