单源最短路径Dijkstra算法详解与教学设计

曲靖师范学院学报 ›› 2016, Vol. 35 ›› Issue (6): 66-68.

单源最短路径Dijkstra算法详解与教学设计

杜衡吉

曲靖师范学院信息工程学院,云南曲靖 655011

收稿日期:2016-09-22 出版日期:2016-11-26
作者简介:杜衡吉,曲靖师范学院信息工程学院讲师,主要从事计算数学及计算机应用研究.

Single-source Shortest Paths Dijkstra Algorithm and Teaching Design

Du Hengji

School of Information Engineering, Qujing Normal University, Qujing YunNan 655011, P. R. China

Received:2016-09-22 Published:2016-11-26

摘要/Abstract

摘要： 《离散数学》是计算机专业的一门重要专业基础课,图论部分又是课程的重点内容,最短路径算法属于难点,学生学起来非常吃力.经过多年教学总结,对最短路径算法给出详细分析,结合教学案例给出了任务驱动的教学设计,对本部分内容的教学和学习有着重要的帮助.

关键词: 离散数学, 图论, 最短路径, 教学设计

Abstract: Discrete mathematics is an important professional basic course for computer science in which the Graph- theory is the focus of the content and the shortest path algorithm is the most difficult part for students to learn. A detailed analysis of the shortest path algorithm is conducted and the task-driven teaching design is provided based on the teaching cases and teaching experiences, which is to benefit the teaching and learning of the contents.

Key words: Discrete Mathematics, Graph- theory, shortest path, teaching design

中图分类号:

TP301.6 G642.0

杜衡吉. 单源最短路径Dijkstra算法详解与教学设计[J]. 曲靖师范学院学报, 2016, 35(6): 66-68.

Du Hengji. Single-source Shortest Paths Dijkstra Algorithm and Teaching Design[J]. JOURNAL OF QUJING NORMAL UNIVERSITY, 2016, 35(6): 66-68.

[1]	黄慧福, 余丽梅. 《食品安全学》课程思政的探索与实践[J]. 曲靖师范学院学报, 2020, 39(1): 125-128.
[2]	欧运波. 论整本书阅读教学设计存在的问题及对策[J]. 曲靖师范学院学报, 2019, 38(5): 83-85.
[3]	巩红冬, 王玉林, 李彪. 究植物学课程史学知识教学设计研究——以“细胞的发现”为例[J]. 曲靖师范学院学报, 2018, 37(3): 53-55.