graph = {'A': ['B', 'C'],

'B': ['C', 'D'],

'C': ['D'],

'D': ['C','G','H'],

'E': ['F'],

'F': ['C']}

#從圖中找出任意一條從起始頂點(diǎn)到終止頂點(diǎn)的路徑

def find_path(graph, start, end, path=[]):

if start == end:

print "path", path

return True

if not graph.get(start):

path.pop()

return False

for v in graph[start]:

if v not in path:

path.append(v)

if find_path(graph,v,end,path):

return True

return False

path = []

if find_path(graph, 'A', 'C', path=path):

print(path)

else:

print(1)

#從圖中找出從起始頂點(diǎn)到終止頂點(diǎn)的所32313133353236313431303231363533e58685e5aeb931333365656465有路徑

import copy

def find_path_all(curr, end, path):

'''

:param curr: 當(dāng)前頂點(diǎn)

:param end: 要到達(dá)的頂點(diǎn)

:param path: 當(dāng)前頂點(diǎn)的一條父路徑

:return:

'''

if curr == end:

path_tmp = copy.deepcopy(path)

path_all.append(path_tmp)

return

if not graph.get(curr):

return

for v in graph[curr]:

#一個(gè)頂點(diǎn)在當(dāng)前遞歸路徑中只能出現(xiàn)一次，否則會(huì)陷入死循環(huán)。

if v in path:

print("v %s in path %s" %(v, path))

continue

#構(gòu)造下次遞歸的父路徑

path.append(v)

find_path_all(v,end,path)

path.pop()

path_all = []

find_path_all('A', 'G',path=['A'])

print path_all

#遍歷圖中所有頂點(diǎn)，按照遍歷順序?qū)㈨旤c(diǎn)添加到列表中

vertex = []

def dfs(v):

if v not in graph:

return

for vv in graph[v]:

if vv not in vertex:

vertex.append(vv)

dfs(vv)

for v in graph:

if v not in vertex:

vertex.append(v)

dfs(v)

print(vertex)

創(chuàng)作挑戰(zhàn)賽新人創(chuàng)作獎(jiǎng)勵(lì)來咯，堅(jiān)持創(chuàng)作打卡瓜分現(xiàn)金大獎(jiǎng)

總結(jié)

以上是生活随笔為你收集整理的python两列数据生成邻接矩阵_用python实现邻接矩阵转换为邻接表，python语言实现...的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。