资源列表
migong-c
- 迷宫算法！通过递归算法实现！找到最优路径，完成迷宫出口的查找！-maze algorithm! Through recursive algorithm! To find the optimal path to complete the maze exports to search!
Apriori(VC程序)
- 本程序是数据挖掘中的关联规则模型中著名的Aprior算法的VC实现程序，可用于知识发现、数据挖掘、人工智能、模式识别等领域（请先解压文件）-The code is the VC implementation of the well-known Aprior algorithm in Association Rule Model of Data Mining field, can be used in Knowledge Discovery, Data Mining, AI, Pattern Re
一个在MFC环境中使用的 InfoZip打包类
- 一个在MFC环境中使用的 InfoZip打包类，使用时需包含UNZDLL.DLL和ZIPDLL.DLL两个动态链接库-an environment in the use of the SDK package type, use and the need to contain UNZDLL.DLL ZIPDLL.DLL two dynamic link library
BDFS
- 用邻接表表示无向图的深度优先搜索遍历 有助于大家理解图的优先遍历问题-adjoining table with no plans to the depth-first search traverse help you understand the plans of the priority issues Traversing
Needle
- 这是一个Offline工具程序，模仿钟表指针的转动位置，计算出指针在各个位置时的坐标值，并输出成C语言文件格式。-Offline This is a procedural tool, imitate watches the rotational position indicators, calculated in various indicators of the location coordinates and exported into C language files.
CRC_FILE_SRC
- 32 bits CRC算法演示,用户可以选择输入一个文件，本工具根据循环雍余校验算法，生成并显示出其32位计算结果。-32 bits CRC algorithm demonstration, a user could choose to import a document, the tools under the revolving Yong I checksum algorithm for generating and demonstrated its 32 results.
svdpackc++.tar
- 矩阵奇异分解(svd)最新c++版本，性能更稳定-matrix decomposition (SVD) c latest version of a more stable performance
svdpackc.tar
- 求矩阵奇异分解svd算法，共计4种实现方式，-for SVD matrix decomposition algorithm, for a total of four kinds of achievement,
lp_solve_4.0.tar
- 利用c语言编写，编译成动态链接库而成的matlab整数规划工具箱,包含c语言源程序，-use of language, compiled DLL from the Matlab Integer Programming Toolbox contains language source c,
fptoolbox
- 指纹识别 这个是TOOLBOX，别人写的。。主要用来识别指纹的处理。。 此文件没有解压密码-Fingerprint Recognition of this is TOOLBOX, written by someone else. . Mainly used to identify fingerprint processing. . This document does not extract passwords
longint1111
- 任意长整数相加问题 任意输入两个任意长的整数进行相加 可以得出正确结果，-arbitrary sum of long integer problem indiscriminate importation of two arbitrarily long integer can be drawn together for the right result,
salesman-temp
- 货郎担 最短路径问题 用链表储存最短路径节点-traveling salesman problem using the shortest path Listless storage nodes Shortest Path