数据结构中图论算法动态智能演示的研究  

Research on dynamic intelligent demonstration of graph-theoretical algorithm in data structure

作　　者：程彩凤[1] 林德树[2] 

机构地区：[1]长江大学工程技术学院,湖北荆州434020 [2]长江大学计算机科学学院,湖北荆州434023

出　　处：《现代电子技术》2017年第18期40-42,共3页Modern Electronics Technique

基　　金：湖北省教育厅科学技术研究项目(B2017438);国家自然科学基金青年科学基金资助项目(61440023)

摘　　要：数据结构课程中图论算法抽象复杂,传统的板书或PPT演示算法程序语句的教学方法不利于学生理解和掌握。在Visual Studio 2013环境下,基于MFC平台研究并设计了一款数据结构课程关于图论算法动态智能演示的教学辅助软件。动态演示了包括图的深度优先遍历、广度优先遍历算法,求最小生成树的Prim算法和Kruskal算法,最短路径Dijkastra算法和Floyd算法的执行过程。软件界面简洁美观,操作简单友好,算法执行过程一目了然,图形界面与算法流程、算法数据信息同步显示。The graph-theoretical algorithm in data structure course is complex. The teaching method of traditional black- board-writing or algorithm program statements of PPT demonstration is not conducive to the students to understand and master. With the Visual Studio 2013, a teaching assistant software about the graph theory algorithms＇ dynamic intelligent demonstration was designed on the basis of MFC platform. The dynamic intelligent demonstration includes the executing process of the depth- first traversal and the breadth-first traversal algorithm, Prim algorithm and Kruskal algorithm for deriving the minimum spanning tree, and the shortest path Dijkastra algorithm and Floyd algorithm. The software interface is concise and artistic, and its opera- tion is simple and friendly. The executing process of the algorithm is clear at a glance. The graphical interface is synchronically displayed with algorithm flow and algorithm data information.

关 键 词：数据结构 图论算法 动态演示 MFC CAI 

分 类 号：TN915.534[电子电信—通信与信息系统] TP39[电子电信—信息与通信工程]