资源列表
m2m_searchingPash
- m2m寻路算法~ 寻路效率最高的算法，能够实现效率较高的寻路-m2m Algorithm for Route ~ find the most efficient path algorithm, to achieve more efficient pathfinding
nqueens
- 深度优先N皇后算法~输入文件形式，可运行代码，开发环境vs2010-Depth-first N-Queens algorithm ~ form of the input file, you can run code development environment vs2010
NormalFormMaker
- 范式生成器。数理逻辑的辅助小程序，可以给出任意命题公式的合取范式和析取范式。主要用二叉树方式实现。包内文档比较详细，介绍了实现的主要思路。-Paradigm generator. Mathematical logic supporting small programs, any propositional formula can be given conjunctive normal form and disjunctive. Mainly be achieved with the binary
Data-compacting
- 这是几篇关于数据精简的比较好的文献，主要包括八叉树和K邻近法等精简算法-This is a few article about data compacting better literature, mainly including octree and K adjacent method simplified algorithm
Kuruskal_Minispining_tree
- 最小生成树Kruskal算法的实现，采用openGL显示界面，支持顶点数量设置，以及位置移动，边的权值可自行设置，界面右侧分两个版图，上方是原图，下方为算法运行过程图-Implement Kruskal minimum spanning tree algorithm, using openGL display interface, support for setting the number of vertices, and the location of the mobile, edge we
task3
- 计算最短路径的算法。本实验实现dijkstra算法。图存储采用了数组存储结构。(Dijkstra algorithm, the shortest path algorithm. This experiment implements the Dijkstra algorithm. The array storage structure is used for graph storage)
pointcardmarketingsystem
- 一个完整的点卡销售系统，是基于c++用vs2005开发的，有源程序和文档设计报告，是我们软件工程的课程设计。-A full point card marketing system is based on using vs2005 c++ development, design reports with source code and documentation is our software engineering course design.
Algorithm-design
- 算法设计专题课件，其中包括各种目前流行的算法。-Algorithm design feature courseware, including a variety of popular algorithms.
xsy
- 数据结构课程设计，链表的插入删除操作，结构合理功能全面-Curriculum design, data structure, linked list insertion deletion, reasonable structure fully functional
HotelManage.zip
- 酒店管理系统介绍说明文档及源代码使用C++MFC开发,Hotel management system documentation and source code C++MFC development
cppjieba-master
- 中文分词功能，采用统计学习算法来实现，准确率较高-Chinese word function, using statistical learning algorithms to achieve high accuracy
update
- 根据邻接矩阵求得图中两个结点之间的最短路径，其中最短路径是指从一个结点到另一个结点的步数，然后再增加一条弧，更新距离矩阵。-Update the distant matrix.