Skip to content

由迪杰斯特拉算法找出所有最短路径并保存

Notifications You must be signed in to change notification settings

letangers/dijkstra

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 

Repository files navigation

# dijkstra
使用语言:python
基础是迪杰斯特拉算法
实现目标:找出两点之间的所有最短路径并存储


图的输入方法如下:

a c 10 e 30 f 100
b c 5
c d 50
d f 10
e f 60
f

About

由迪杰斯特拉算法找出所有最短路径并保存

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages