It has been conjectured that there is a hamiltonian cycle in every finite connected Cayley graph.In spite of the difficulty in proving this conjecture,we show that almost all Cayley graphs are hamiltonian.That is,as t...It has been conjectured that there is a hamiltonian cycle in every finite connected Cayley graph.In spite of the difficulty in proving this conjecture,we show that almost all Cayley graphs are hamiltonian.That is,as the order n of a group G approaches infinity,the ratio of the number of hamiltonian Cayley graphs of G to the total number of Cayley graphs of G approaches 1.展开更多
数据结构课程中图论算法抽象复杂,传统的板书或PPT演示算法程序语句的教学方法不利于学生理解和掌握。在Visual Studio 2013环境下,基于MFC平台研究并设计了一款数据结构课程关于图论算法动态智能演示的教学辅助软件。动态演示了包括图...数据结构课程中图论算法抽象复杂,传统的板书或PPT演示算法程序语句的教学方法不利于学生理解和掌握。在Visual Studio 2013环境下,基于MFC平台研究并设计了一款数据结构课程关于图论算法动态智能演示的教学辅助软件。动态演示了包括图的深度优先遍历、广度优先遍历算法,求最小生成树的Prim算法和Kruskal算法,最短路径Dijkastra算法和Floyd算法的执行过程。软件界面简洁美观,操作简单友好,算法执行过程一目了然,图形界面与算法流程、算法数据信息同步显示。展开更多
基金Supported by the National Natural Science Foundation of China,Xinjiang Educational Committee and Xinjiang University.
文摘It has been conjectured that there is a hamiltonian cycle in every finite connected Cayley graph.In spite of the difficulty in proving this conjecture,we show that almost all Cayley graphs are hamiltonian.That is,as the order n of a group G approaches infinity,the ratio of the number of hamiltonian Cayley graphs of G to the total number of Cayley graphs of G approaches 1.
文摘数据结构课程中图论算法抽象复杂,传统的板书或PPT演示算法程序语句的教学方法不利于学生理解和掌握。在Visual Studio 2013环境下,基于MFC平台研究并设计了一款数据结构课程关于图论算法动态智能演示的教学辅助软件。动态演示了包括图的深度优先遍历、广度优先遍历算法,求最小生成树的Prim算法和Kruskal算法,最短路径Dijkastra算法和Floyd算法的执行过程。软件界面简洁美观,操作简单友好,算法执行过程一目了然,图形界面与算法流程、算法数据信息同步显示。
