迪杰斯特拉（Dijkstra）算法 python2.7

最新推荐文章于 2024-05-20 22:46:16 发布

lxhseph

最新推荐文章于 2024-05-20 22:46:16 发布

阅读量137

点赞数

文章标签：算法 python

本文链接：https://blog.csdn.net/lxhseph/article/details/120659523

版权

# coding=utf-8
# This is a sample Python script.
# Press Shift+F10 to execute it or replace it with your code.
# Press Double Shift to search everywhere for classes, files, tool windows, actions, and settings.
# Definition for singly-linked list.
#建立有向无环图
graph={}
graph['music']={}
graph['music']['poster']=0
graph['music']['vinyl']=5
graph['poster']={}
graph['poster']['guitar']=30
graph['poster']['drum']=35
graph['vinyl']={}
graph['vinyl']['drum']=20
graph['vinyl']['guitar']=15
graph['guitar']={}
graph['guitar']['piano']=20
graph['drum']={}
graph['drum']['piano']=10
graph['piano']={}
def Dijkistra(start,end):
    """

    :param start:
    :param end:
    :return:
    costTF:开销列表，元素包含4个信息[0]&#