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

发布时间：2018-05-18 04:24

本文选题：数据结构 + 图论算法　；参考：《现代电子技术》2017年18期

【摘要】：数据结构课程中图论算法抽象复杂,传统的板书或PPT演示算法程序语句的教学方法不利于学生理解和掌握。在Visual Studio 2013环境下,基于MFC平台研究并设计了一款数据结构课程关于图论算法动态智能演示的教学辅助软件。动态演示了包括图的深度优先遍历、广度优先遍历算法,求最小生成树的Prim算法和Kruskal算法,最短路径Dijkastra算法和Floyd算法的执行过程。软件界面简洁美观,操作简单友好,算法执行过程一目了然,图形界面与算法流程、算法数据信息同步显示。
[Abstract]:In the course of data structure, graph theory algorithm is abstract and complex, and the traditional teaching method of blackboard writing or PPT demonstrating algorithm program is not good for students to understand and master. In the environment of Visual Studio 2013, based on the MFC platform, this paper studies and designs a teaching assistant software for the dynamic intelligent demonstration of graph theory algorithm in the course of data structure. Dynamic demonstration includes depth first traversal, breadth first traversal algorithm, Prim algorithm and Kruskal algorithm, shortest path Dijkastra algorithm and Floyd algorithm. The software interface is simple and beautiful, the operation is simple and friendly, the algorithm execution process is clear, the graphical interface and the algorithm flow, the algorithm data information synchronizes display.
【作者单位】：长江大学工程技术学院;长江大学计算机科学学院;
【基金】：湖北省教育厅科学技术研究项目(B2017438) 国家自然科学基金青年科学基金资助项目(61440023)
【分类号】：O157.5;TP311.12

【相似文献】