搜索资源列表
Windows图形编程
- Windows图形编程(英文),留美学者袁峰的一本绝嘉好书.我好不容易才找到,还买了此书的中文版.此书深入api,windows内部核心数据结构,direct核心数据结构,gui编程,字体结构. 强烈推荐-Windows graphical programming (English), the holder of the scholar Yuan Feng-chia never a good book. I finally find, but also bought a book of the
eclat
- A program to find frequent itemsets (also closed and maximal) with the eclat algorithm ,which carries out a depth first search on the subset lattice and determines the support of itemsets by intersecting transaction lists. -A program to find frequent
ZIP_Deflate_Algorithm
- 通过讲解gzip源码，对zip领域的流行算法－deflate 进行深入的分析，本文是目前迄今为止可以找到的对deflate分析得较好一篇文章。-through gzip on the source, zip right field of popular algorithm-deflate an in-depth analysis, This is the current date can find the right deflate a better analysis of the articl
基于AI的问题求解
- 提供了深度优先搜索,广度优先搜索,添加启发信息的最小代价搜索,查找多个解,查找最优解的范例程序.-a depth-first search, breadth - first search, add the information inspired the minimum price for a search of solutions to search, find out the optimal solution sample programs.
AT89C2051 刻录程序
- 支持AT89C2051的刻录，原理在ATMEL公司的资料里面可以完全找到，完全自创，如各位有兴趣深入了解可以发邮件到micheal23@sohu.com，对初学者绝对有很大帮助-support AT89C2051 burner, in principle ATMEL information inside the company can find a fully self, if you are interested in-depth understanding can be distribute
Wrox.Professional.ASP.NET.2.0.Databases.Feb.2007.eBook-BBL
- Who This Book Is For This book is aimed at intermediate or experienced programmers who have started on their journey toward ASP.NET development and who are already familiar with relational databases such as SQL Server. While readers won’t be intro
depth
- 构造二叉树，并求叶子节点的个数和该二叉树的深度。-Construct a binary tree, and find the number of leaf nodes and the binary tree of depth.
guohewenti
- 试运用深度优先搜索算法寻找过河问题的一个解决方案，题目叙述如下：猎人、狗、男人带着男孩1、男孩2，女人带着女孩1、女孩2，一共8个个体。一艘小船，一次只能过两个个体，狗和四个小孩不会划船。注意：（1）猎人不在，狗咬任何人；（2）男人不在，女人打男孩；（3）女人不在，男人打女孩。-Test the use of depth-first search algorithm to find a solution to cross the river problem, topics are describ
adj1
- 基于伴随算子的优化算法，伴随算子作为一个当今优化领域中一个比较有前途的算法，欧美各国都对此作了比较深入的研究，他大大缩短了多参数优化中所需要的时间，可以一次求出所以的下降梯度，求解时间和求解一次流场的时间相当。-Adjoint operator-based optimization algorithm, with the operator as an optimization of today' s one of the more promising algorithms, Europea
datastructure
- 数据结构二叉树实验报告，包括 （1）创建二叉树 （2）递归算法先序遍历二叉树 （3）非递归算法中序遍历二叉树 （4）递归算法后序遍历二叉树 （5）求二叉树叶子结点个数 （6）按层次遍历二叉树 （7）求二叉树树深 -A binary tree data structure, experimental report, including (1) Create a binary tree (2) recursive algorithm for preorder trav
structure
- 数据结构二叉树实现代码：功能如下： （1）创建二叉树 （2）递归算法先序遍历二叉树 （3）非递归算法中序遍历二叉树 （4）递归算法后序遍历二叉树 （5）求二叉树叶子结点个数 （6）按层次遍历二叉树 （7）求二叉树树深 -A binary tree data structure to achieve the code: Function is as follows: (1) Create a binary tree (2) recursive alg
find
- Dialog程序，打开文件夹，添加文件，读取文件，将文件内容显示，语音功能，深度搜索，添加到列表中 -Dialog program, open the folder, add files, read documents, the documents show, voice features, in-depth search, add to the list
Link_Find
- 编写能实现上述功能的Link(v,r)指令程序，不要使用全局变量， 设初始时两森林均由单结点树构成。上机依次执行：Link(2,1), Link(3,2), Link(5,4), Link(4,3), Link(7,6),Link(9,8), Link(8,7), Find-Depth(6), Link(6,5), Find-Depth(4), Find-Depth(7)。 打印或抄写每条指令执行后各点的Weight值，画出其时的两种森林。 -Prepared to a
Depth_image
- Algorithm to find Depth of Image
depth-understanding--the-pointer
- 指针是一个特殊的变量，它里面存储的数值被解释成为内存里的一个地址。要搞清一个指针 需要搞清指针的四方面的内容：指针的类型，指针所指向的类型，指针的值或者叫指针所指 向的内存区，还有指针本身所占据的内存区。-Pointer is a special variable, the value stored inside it is interpreted as a memory address. To find out the pointer to a pointer needs to fin
An-In-Depth-Look-into-the-Win32
- 你可能想知道为什么要关注可执行文件的格式。答案永远是：操作系统的可执行文件格式和数据结构展现了操作系统内部许多信息。通过理解 EXE和 DLL 的内部情况，你会发现你已经变成你周围一个更优秀的程序员。 -You may want to know why the attention to executable file format. The answer is always: operating system executable file format and data structu
openni-color-depth-combine
- 关于openni2编程的源码，opennni2与openni相比变化较大，个人也刚学习，从各种途径也没找到太多例程，先分享下自己找的的入门源码。 程序实现了从kinect获取数据流并将深度图像及彩色图像融合显示，非3d效果，但是具有一定了参考价值。 没有附加自己的配置sln文档，因为我不是默认安装，所以请自己配置，然后将cpp源码添加替换即可，不明白可以联系qq1050654578.-About openni2 programming the source, opennni2 openn
openni-color-depth-show
- 关于openni2编程的源码，opennni2与openni相比变化较大，个人也刚学习，从各种途径也没找到太多例程，先分享下自己找的的入门源码。 程序实现了从kinect获取数据并分别显示深度图像、彩色图像的功能。-About openni2 programming the source, opennni2 openni compared, individuals also just learning from a variety of sources, did not find much
Maze-depth-first-algorithm
- 迷宫深度优先算法，深度优先是按照一定的顺序查找完一个分支，再查找另外一个分支，直到找到目标为止。-Depth first is according to certain order to find a branch, then find another branch, until find the target.
Project1-2
- 利用递归算法实现二叉树的生成，求深度，求叶子数，中序遍历和后序遍历(Recursive algorithm is used to generate two binary tree, find depth, find leaf number, sequential traversal and post traversal.)