迪杰斯特拉最短路径算法演示——数据结构大作业

迪杰斯特拉最短路径演示

# -*- coding: utf-8 -*-
"""
Created on Mon. January 3 22:35:42 2022
@author: pcx，sjy
"""

from tkinter import *
import tkinter.messagebox
from PIL import Image,ImageTk
import networkx as nx
import matplotlib.pyplot as plt
import time

INF=100000
sleep_time=0.2
#demo
"""
0,6,4,inf,7,inf,inf,inf,16,inf,5,3,10,inf,2;
6,0,inf,12,inf,2,inf,3,12,inf,inf,inf,inf,2,inf;
4,inf,0,3,inf,inf,2,2,inf,8,11,5,9,inf,3;
inf,12,3,0,4,8,inf,inf,3,inf,inf,inf,inf,3,8;
7,inf,inf,4,0,6,14,13,inf,2,inf,inf,2,14,6;
inf,2,inf,8,6,0,8,3,2,inf,5,inf,7,3,12;
inf,inf,2,inf,14,8,0,6,3,17,12,13,6,inf,inf;
inf,3,2,inf,13,3,6,0,2,8,10,3,inf,inf,7;
16,12,inf,3,inf,2,3,2,0,4,2,4,inf,3,inf;
inf,inf,8,inf,2,inf,17,8,4,0,3,inf,6,11,inf;
5,inf,11,inf,inf,5,12,10,2,3,0,7,3,2,4;
3,inf,5,inf,inf,inf,13,3,4,inf,7,0,inf,12,3;
10,inf,9,inf,2,7,6,inf,inf,6,3,inf,0,inf,6;
inf,2,inf,3,14,3,inf,inf,3,11,2,12,inf,0,2;
2,inf,3,8,6,12,inf,7,inf,inf,4,3,6,2,0
"""
root = Tk()
root.title("最短路径——窜天猴游乐园")
root.geometry('1250x1080')
root.configure(background='#99CCCC')

#是x 不是*    '1000x600'
#root.resizable(width=True, height=True) #宽不可变, 高可变,默认为True

#algrithm
#dij
#http://www.cnblogs.com/biyeymyhjob/archive/2012/07/31/2615833.html
#http://blog.csdn.net/littlethunder/article/details/9748519
def Dijkstra(arraylist,start,n):
    dis = [0]*n
    flag = [False]*n
    pre = [start]*n
    points = []
    k = start
    flag[k]=True
    for i in range(n):
        dis[i] = arraylist[k][i]
    for i in range(n-1):
        mini = INF
        for j in range(n):
            if not flag[j] and dis[j]<mini:
                mini = dis[j]
                k = j
        if k==start:#不连通
            return
        flag[k] = True
        for j in range(n):
            if dis[j]>dis[k]+arraylist[k][j]:
                dis[j] = dis[k]+arraylist[k][j]
                pre[j] = k
        points.append(k)
    dist = []
    path = []
    for point in points:
        dist.append(dis[point])
        path_point = []
        while(pre[point]!=start):
            path_point.insert(0,(pre[point],point))
            point = pre[point]
        path_point.insert(0,(start,point))
        path.append(path_point)
    return points,dist,path

#处理
def solution():
   selection = "You selected the option " + str(var.get())
   print(selection)
   algorithm = var.get()
   return algorithm
def BeginProject():
    print("开始执行！")
    t6.delete('0.0', END)
    sampleInput = t2.get("0.0",END)
    print (sampleInput)
    sampleInput = sampleInput.replace('\n','').split(';')
    arraylist = []
    for item in sampleInput:
        arraylist_col=[]
        item = item.split(',')
        for item2 in item:
            if item2!="inf":
                arraylist_col.append(int(item2))
            else:
                arraylist_col.append(INF)
        if len(arraylist_col)>0:
            arraylist.append(arraylist_col)
    for item in arraylist:
        if len(arraylist)!=len(item):
            tkMessageBox.showinfo("Error","请检查输入的邻接矩阵！")
            return
    n = len(arraylist)
    start = int(e4.get())
    if(start>=len(arraylist)):
        tkMessageBox.showinfo("Error","起始点不能大于点的总数！")
        return
    
    #建图
    plt.clf()
    G = nx.Graph()
    e=[]
    ew = {}
    for i in range(0,len(arraylist)):
        for j in range(0,len(arraylist[i])):
            if arraylist[i][j]<INF:
                e.append((i,j,arraylist[i][j]))
                ew[(i,j)] = arraylist[i][j]
    G.add_weighted_edges_from(e)
    pos = nx.spring_layout(G)
    nx.draw(G, pos, with_labels = True, node_size = 500 ,hold=True,node_color ='w')
    nx.draw_networkx_edge_labels(G,pos,ew)
    nx.draw_networkx_nodes(G,pos,nodelist=[start],node_color ='b',node_size = 700)
    plt.savefig('path' +'.jpg')
    filename = ".\path.jpg"
    image = Image.open(filename)
    photo = ImageTk.PhotoImage(image)
    canvas.create_image(450,250,image = photo)
    canvas.update()
    time.sleep(sleep_time)
    
    algorithm=0
    algorithm = solution()
    if algorithm==0:
        tkMessageBox.showinfo("Error","请先选择需要使用的算法!")
        return
    else:#dij
        points,dist,path = Dijkstra(arraylist,start,n)
        for i in range(0,len(points)):
            print (points[i])
            str_path = str(start)
            for j in range(len(path[i])):
                str_path = str_path + '->' + str(path[i][j][1])
            print (str_path)
            t6.insert(END,str_path+"\n")
            nx.draw_networkx_nodes(G,pos,nodelist=[points[i]],node_color = 'g',node_size = 600)
            nx.draw_networkx_edges(G,pos,edgelist=path[i],width=6,edge_color = 'red')
            plt.savefig('path' +'.jpg')
            filename = ".\path.jpg"
            image = Image.open(filename)
            photo = ImageTk.PhotoImage(image)
            canvas.create_image(450,250,image = photo)
            canvas.update()
            time.sleep(sleep_time)
    time.sleep()


#frame容器
frame_top = Frame(width=400, height=10,bg='red')
frame_r1 = Frame(width=300,height=10)#邻接矩阵
frame_r2 = Frame(width=260,height=150,bg='white')#邻接矩阵下面的输入框
frame_r3 = Frame(width=260,height=10)#起始点
frame_r4 = Frame(width=260,height=50)#起始点输入文本框
frame_r5 = Frame(width=260,height=50)#打印路径框
frame_r6 = Frame(width=260,height=150,bg='white')
frame_l1 = Frame(width=130, height=50)#算法选择框，里面放按钮，放在第二行
frame_l2 = Frame(width=130, height=50)
frame_l3 = Frame(width=130, height=50)
frame_mid = Frame(width=800,height=100,bg='white')#画图区域
frame_bottom = Frame(width=200,height=50)

#使用grid设置各个容器位置
frame_top.grid(row=0, column=0,columnspan=2, padx=200, pady=5)#标题行
frame_l1.grid(row=3,column=0)

frame_mid.grid(row=5,column=1,rowspan=6,columnspan=2,padx=4, pady=5)
frame_r1.grid(row=5,column=0,sticky=W,padx=40)
frame_r2.grid(row=6,column=0,padx=40, pady=5)
frame_r3.grid(row=7,column=0,sticky=W,padx=40)
frame_r4.grid(row=8,column=0,sticky=W,padx=40)
frame_r5.grid(row=5,column=2,sticky=W)
frame_r6.grid(row=6,column=2,padx=2, pady=5)
frame_bottom.grid(row=3,column=1,columnspan=1)#第三行


#创建需要的元素
l_title = Label(frame_top, text="最短路径",bg='#99CCCC', font=('fangsong', 50))#标题行字体配置
var = IntVar()
R= Radiobutton(frame_l1, text="Dijkstra算法",bg='#99CCCC',variable=var, value=1,command=solution,font=('fangsong', 30))#算法选择按钮
canvas = Canvas(frame_mid,width = 800,height = 600,bg = '#FFCCCC')#画板

l_r1 = Label(frame_r1, text="邻接矩阵",bg='#99CCCC',font=('fangsong', 20))
l_r3 = Label(frame_r3, text="起始点",bg='#99CCCC',font=('fangsong', 20))
l_r5 = Label(frame_r5, text="打印路径")
vart4 = IntVar()
e4 = Entry(frame_r4, textvariable = vart4,width = 40,bg = '#FFCCCC')

t2 = Text(frame_r2,width = 40,height = 13,bg = '#FFCCCC')
t6 = Text(frame_r6,width = 40,height = 13,bg = '#FFCCCC')
button_start = Button(frame_bottom,text="开始执行",bg='#FFCC99',font=('fangsong', 30),command=BeginProject)


#把元素填充进frame
l_title.grid()
R.grid(sticky=E)
canvas.grid()
l_r1.grid(sticky=E)
l_r3.grid(sticky=E)
l_r5.grid(sticky=E)
t2.grid()
e4.grid()
t6.grid()
button_start.grid()

mainloop()

测试用例：

0,6,4,inf,7,inf,inf,inf,16,inf,5,3,10,inf,2;
6,0,inf,12,inf,2,inf,3,12,inf,inf,inf,inf,2,inf;
4,inf,0,3,inf,inf,2,2,inf,8,11,5,9,inf,3;
inf,12,3,0,4,8,inf,inf,3,inf,inf,inf,inf,3,8;
7,inf,inf,4,0,6,14,13,inf,2,inf,inf,2,14,6;
inf,2,inf,8,6,0,8,3,2,inf,5,inf,7,3,12;
inf,inf,2,inf,14,8,0,6,3,17,12,13,6,inf,inf;
inf,3,2,inf,13,3,6,0,2,8,10,3,inf,inf,7;
16,12,inf,3,inf,2,3,2,0,4,2,4,inf,3,inf;
inf,inf,8,inf,2,inf,17,8,4,0,3,inf,6,11,inf;
5,inf,11,inf,inf,5,12,10,2,3,0,7,3,2,4;
3,inf,5,inf,inf,inf,13,3,4,inf,7,0,inf,12,3;
10,inf,9,inf,2,7,6,inf,inf,6,3,inf,0,inf,6;
inf,2,inf,3,14,3,inf,inf,3,11,2,12,inf,0,2;
2,inf,3,8,6,12,inf,7,inf,inf,4,3,6,2,0

注意选择算法和填写起始点！