最短路径问题
计算机科学
Dijkstra算法
寻路
可视化
K最短路径路由
最宽路径问题
最短路径快速算法
延氏算法
欧氏最短路径
理论计算机科学
图形
图形绘制
路径(计算)
算法
数据挖掘
程序设计语言
作者
Radoslav Mavrevski,Metodi Traykov,Ivan Trenchev
出处
期刊:International Journal of Electrical and Computer Engineering
[Institute of Advanced Engineering and Science]
日期:2020-04-01
卷期号:10 (2): 2054-2054
被引量:3
标识
DOI:10.11591/ijece.v10i2.pp2054-2059
摘要
The shortest path problem is a classic problem in mathematics and computer science with applications in Economics (sequential decision making, analysis of social networks, etc.). The presented work is an example of realizing and applying of Dijkstra's algorithm to find the shortest path between two vertices in a connected, undirected graph, which is often a solved problem at a time annual International Olympiad in Informatics. For this purpose, are used the technologies, .NET 4.0, Visual Studio 2010, and WPF for the graphical user interface. The implemented program allows drawing an undirected graph, visualizing the shortest path between two vertices and finding its value. This software is a valuable tool for the study of Dijkstra's algorithm and is a great pedagogic instrument. All figures of path visualization included in this paper are actual screenshots of our visualization program.
科研通智能强力驱动
Strongly Powered by AbleSci AI