中文字幕理论片,69视频免费在线观看,亚洲成人app,国产1级毛片,刘涛最大尺度戏视频,欧美亚洲美女视频,2021韩国美女仙女屋vip视频

閱讀目錄

• 無向圖
• 有向圖
• 加權(quán)圖
• 經(jīng)典圖論算法計算
• 強(qiáng)連通、弱連通
• 子圖
• 條件過濾
• pred，succ

import networkx as nxprint nx

#!-*- coding:utf8-*- import networkx as nximport matplotlib.pyplot as pltG = nx.Graph()                 #建立一個空的無向圖GG.add_node(1)                  #添加一個節(jié)點1G.add_edge(2,3)                #添加一條邊2-3（隱含著添加了兩個節(jié)點2、3）G.add_edge(3,2)                #對于無向圖，邊3-2與邊2-3被認(rèn)為是一條邊print "nodes:", G.nodes()      #輸出全部的節(jié)點： [1, 2, 3]print "edges:", G.edges()      #輸出全部的邊：[(2, 3)]print "number of edges:", G.number_of_edges()   #輸出邊的數(shù)量：1nx.draw(G)plt.savefig("wuxiangtu.png")plt.show()

#-*- coding:utf8-*- import networkx as nximport matplotlib.pyplot as pltG = nx.DiGraph()G.add_node(1)G.add_node(2)                  #加點G.add_nodes_from([3,4,5,6])    #加點集合G.add_cycle([1,2,3,4])         #加環(huán)G.add_edge(1,3)     G.add_edges_from([(3,5),(3,6),(6,7)])  #加邊集合nx.draw(G)plt.savefig("youxiangtu.png")plt.show()

#!-*- coding:utf8-*- import networkx as nximport matplotlib.pyplot as pltG = nx.DiGraph()G.add_node(1)G.add_node(2)G.add_nodes_from([3,4,5,6])G.add_cycle([1,2,3,4])G.add_edge(1,3)G.add_edges_from([(3,5),(3,6),(6,7)])nx.draw(G)plt.savefig("youxiangtu.png")plt.show()

#!-*- coding:utf8-*- import networkx as nximport matplotlib.pyplot as pltG = nx.DiGraph()G.add_node(1)G.add_node(2)G.add_nodes_from([3,4,5,6])G.add_cycle([1,2,3,4])G.add_edge(1,3)G.add_edges_from([(3,5),(3,6),(6,7)])G = G.to_undirected()nx.draw(G)plt.savefig("wuxiangtu.png")plt.show()

#-*- coding:utf8-*-import networkx as nximport matplotlib.pyplot as pltG = nx.DiGraph()road_nodes = {'a': 1, 'b': 2, 'c': 3}#road_nodes = {'a':{1:1}, 'b':{2:2}, 'c':{3:3}}road_edges = [('a', 'b'), ('b', 'c')]G.add_nodes_from(road_nodes.iteritems())G.add_edges_from(road_edges)nx.draw(G)plt.savefig("youxiangtu.png")plt.show()

#-*- coding:utf8-*-import networkx as nximport matplotlib.pyplot as pltG = nx.DiGraph()#road_nodes = {'a': 1, 'b': 2, 'c': 3}road_nodes = {'a':{1:1}, 'b':{2:2}, 'c':{3:3}}road_edges = [('a', 'b'), ('b', 'c')]G.add_nodes_from(road_nodes.iteritems())G.add_edges_from(road_edges)nx.draw(G)plt.savefig("youxiangtu.png")plt.show()

#!-*- coding:utf8-*- import networkx as nximport matplotlib.pyplot as pltG = nx.Graph()                                        #建立一個空的無向圖GG.add_edge(2,3)                                     #添加一條邊2-3（隱含著添加了兩個節(jié)點2、3）G.add_weighted_edges_from([(3, 4, 3.5),(3, 5, 7.0)])                                     #對于無向圖，邊3-2與邊2-3被認(rèn)為是一條邊print G.get_edge_data(2, 3)print G.get_edge_data(3, 4)print G.get_edge_data(3, 5)nx.draw(G)plt.savefig("wuxiangtu.png")plt.show()

{}{'weight': 3.5}{'weight': 7.0}

# -*- coding: cp936 -*-import networkx as nximport matplotlib.pyplot as plt #計算1：求無向圖的任意兩點間的最短路徑G = nx.Graph()G.add_edges_from([(1,2),(1,3),(1,4),(1,5),(4,5),(4,6),(5,6)])path = nx.all_pairs_shortest_path(G)print path[1]

import networkx as nxG=nx.Graph()G.add_nodes_from([1,2,3,4])G.add_edge(1,2)G.add_edge(3,4)try:    n=nx.shortest_path_length(G,1,4)    print nexcept nx.NetworkXNoPath:    print 'No path'

#-*- coding:utf8-*- import networkx as nximport matplotlib.pyplot as plt#G = nx.path_graph(4, create_using=nx.Graph())#0 1 2 3G = nx.path_graph(4, create_using=nx.DiGraph())    #默認(rèn)生成節(jié)點0 1 2 3，生成有向變0->1,1->2,2->3G.add_path([7, 8, 3])  #生成有向邊：7->8->3for c in nx.weakly_connected_components(G):    print cprint [len(c) for c in sorted(nx.weakly_connected_components(G), key=len, reverse=True)]nx.draw(G)plt.savefig("youxiangtu.png")plt.show()

set([0, 1, 2, 3, 7, 8])[6]

#-*- coding:utf8-*- import networkx as nximport matplotlib.pyplot as plt#G = nx.path_graph(4, create_using=nx.Graph())#0 1 2 3G = nx.path_graph(4, create_using=nx.DiGraph())G.add_path([3, 8, 1])#for c in nx.strongly_connected_components(G):#    print c##print [len(c) for c in sorted(nx.strongly_connected_components(G), key=len, reverse=True)]con = nx.strongly_connected_components(G)print conprint type(con)print list(con)nx.draw(G)plt.savefig("youxiangtu.png")plt.show()

<generator object strongly_connected_components at 0x0000000008AA1D80><type 'generator'>[set([8, 1, 2, 3]), set([0])]

#-*- coding:utf8-*- import networkx as nximport matplotlib.pyplot as pltG = nx.DiGraph()G.add_path([5, 6, 7, 8])sub_graph = G.subgraph([5, 6, 8])#sub_graph = G.subgraph((5, 6, 8))  #ok  一樣nx.draw(sub_graph)plt.savefig("youxiangtu.png")plt.show()

#-*- coding:utf8-*-import networkx as nximport matplotlib.pyplot as pltG = nx.DiGraph()road_nodes = {'a':{'id':1}, 'b':{'id':1}, 'c':{'id':3}, 'd':{'id':4}}road_edges = [('a', 'b'), ('a', 'c'), ('a', 'd'), ('b', 'd')]G.add_nodes_from(road_nodes)G.add_edges_from(road_edges)nx.draw(G)plt.savefig("youxiangtu.png")plt.show()

#-*- coding:utf8-*-import networkx as nximport matplotlib.pyplot as pltG = nx.DiGraph()def flt_func_draw():    flt_func = lambda d: d['id'] != 1    return flt_funcroad_nodes = {'a':{'id':1}, 'b':{'id':1}, 'c':{'id':3}, 'd':{'id':4}}road_edges = [('a', 'b'), ('a', 'c'), ('a', 'd'), ('b', 'd')]G.add_nodes_from(road_nodes.iteritems())G.add_edges_from(road_edges)flt_func = flt_func_draw()part_G = G.subgraph(n for n, d in G.nodes_iter(data=True) if flt_func(d))nx.draw(part_G)plt.savefig("youxiangtu.png")plt.show()

#-*- coding:utf8-*-import networkx as nximport matplotlib.pyplot as pltG = nx.DiGraph()road_nodes = {'a':{'id':1}, 'b':{'id':1}, 'c':{'id':3}}road_edges = [('a', 'b'), ('a', 'c'), ('c', 'd')]G.add_nodes_from(road_nodes.iteritems())G.add_edges_from(road_edges)print G.nodes()print G.edges()print "a's pred ", G.pred['a']print "b's pred ", G.pred['b']print "c's pred ", G.pred['c']print "d's pred ", G.pred['d']print "a's succ ", G.succ['a']print "b's succ ", G.succ['b']print "c's succ ", G.succ['c']print "d's succ ", G.succ['d']nx.draw(G)plt.savefig("wuxiangtu.png")plt.draw()