搜索资源列表
二叉树的高度程序！
- 本文用Ｃ语言实现了求二叉树深度的程序，数据结构采用链表-Using C Language for the depth of procedures binary tree data structure used Chain
PBFSandDFS
- 对与数据结构中有向图采用邻接矩阵为存储结构实现有向图建立、深度优先遍历和广度优先遍历、并带有图片测试数据 可运行-And the data structure of a directed graph with adjacency matrix storage structure established to achieve a directed graph, depth-first traversal and breadth-first traversal, and test data can
graph
- 实现图的深度优先遍历和图的广度优先遍历的控制台应用程序-Graph depth-first traversal and graph breadth-first traversal of the console application
graph2
- 输入图的顶点和边，可以选择对图进行深度或者广度遍历。-Input graph vertices and edges, you can choose the depth, or breadth of the graph traversal.
FFT
- 本程序中包含一个可以通用的头文件，它能够实现DFT，FFT，IFFT，conv，这些函数根据信号处理C语言程序集编写，为了方便理解与调用，我在程序中使用了一些实例，大家可以通过它们做深入理解！-This procedure can include a generic header, it can be achieved DFT, FFT, IFFT, conv, these functions according to the signal processing assembly C langu
migong
- 利用深度搜索方法解决迷宫问题，迷宫的形状可以自由载入。-Search method to solve the maze using the depth of the problem, the shape of the maze are free to load.
subway-exchange-system
- 地铁换乘系统，以北京地铁线路为例，求最少换乘线路，采用深度搜索的方式。-Subway transfer system to the Beijing subway line, for example, seeking a minimum transfer line, using the depth search.
FindWay
- 三种主流寻路方式(A星,广度,深度) 目前3种主流寻路的源码,a星(a*),广度优先,深度优先。压缩包附带了一张自己写的堆和顺序表，以及一个控制台绘图模块。-The three mainstream the pathfinding way (A star, the breadth, depth) of three kinds of major pathfinding source code, a star (*), breadth-first, depth-first. Compressio
Chapter1
- windows消息运行机制，VC++深入详解第一章，mfc的内部运行原理-the windows messages run mechanism, VC++ Depth explain the internal operation principle, mfc
Tree-traversal
- MFC实现树的建立，可自动得到输入树的深度，先序、中序、后序遍历的结果，并用图形显示该树。-MFC to achieve the establishment of the tree can be automatically input the depth of the tree, preorder, inorder, postorder traversal, and graphical display of the tree.
idas
- 使用迭代深入优先搜索解决八数码问题,并且在算法实现过程中进行了剪纸优化功能-Using an iterative depth-first search to solve eight digital
template
- template 模版函数 函数模版 深入了解-template template template-depth understanding of the function function
BinaryTree
- 建立二叉树并进行各种遍历、求树的深度和高度-build binarytree and transvers in all ways,and caculate height and depth.
BinTree
- 二叉排序树，实现树的各种操作，包括计算深度，找最大值最小值，还有各种遍历的递归算法和非递归算法，以及查找查找树的前驱节点和后继节点-Binary sort tree, the tree to achieve various operations, including the calculation of depth, looking for maximum minimum, there are various recursive traversal algorithm and non-recur
TaskDistribution
- 算法设计与分析中的任务分配问题。 用回溯法解该问题时，用完全n叉树表示解空间。可行性条件select 剪去不满足行、列约束的子树。递归方法 backtrack(1)实现对整个解空间的回溯搜索；backtrack(i)搜索解空间中的第i层子树，sum记录当前已找到的可行方案 数。在算法backtrack中，当i>n时，算法搜索至叶子结点，当前已找到的可行方案数sum加1；当i<=n时，当前扩展结点 Z是解空间中的内部结点。该结点有x[i]=1,2,...,n共n个
ALGraph
- 图的邻接表存储下的深度优先遍历，广度优先遍历，以及拓扑排序-Adjacency table storage, the depth-first traversal, breadth-first traversal, and topological sorting
deep-search-for-eight-digital-issue
- 深度搜索实现八数码问题。控制台应用，源码和exe文件-Depth search to achieve eight digital problem. Console applications, source code and exe files
CNN
- 本程序实现深度学习的卷积神经网络（CNN）算法，含有训练程序和测试程序-This program implements convolution depth learning neural network (CNN) algorithm contains training programs and test procedures
Model-answer
- 4.24 (Knight’s Tour) One of the more interesting puzzlers for chess buffs is the Knight’s Tour problem, originally proposed by the mathematician Euler. The question is this: Can the chess piece called the knight move around an empty chessboard and
restricted-boltzmann-machines-master
- 深度学习 rbm 学习受限波特字母机的好材料-Porter limited depth study rbm machine learning good materialr