搜索资源列表
tre_dfs
- a multinode tree structure with DFS depth first search algorithm
DFSBFS
- 设计一个有向图，建立图的邻接矩阵或邻接表的存储结构，完成有向图的DFS（深度优先遍历）和BFS（广度优先遍历）的操作-Design of a directed graph, the establishment of the adjacency matrix or adjacency list of the storage structure, complete directed graph DFS (depth-first traversal) and BFS (breadth-first tr
AIDFS
- 实现C#深度优先搜索七巧板程序,完成七巧板深度优先搜索的解答，算法对固定图效果还好-depth first search DFS AI
Graph
- 该程序主要完成对图的创建，并实现图的深度优先遍历和广度优先遍历-The program mainly to complete the creation of a graph, and to achieve depth-first graph traversal and breadth-first traversal
graph_C(1)
- 建立无向图的邻接矩阵存储；对已经建立的无向图进行深度优先和广度优先遍历操作。建立有向图的邻接表存储；对已经建立的有向图进行深度优先和广度优先遍历操作。 -Establishment of the adjacency matrix storage on the already established undirected graph depth first and breadth-first traversal operation. Establish a table to store th
tubianli
- 对图的邻接表表示进行深度优先遍历和广度优先遍历。-The adjacency list representation of the depth-first traversal and breadth-first traversal.
fuck
- 三个程序，一个是huffman编码的，一个是深度优先算法的-Three programs, one is huffman coding, a depth-first algorithm is
shengchengshu
- 8.3.5利用邻接表图的深度优先生成树生成算法-8.3.5 adjacency list graph using depth-first spanning tree generation algorithm
11
- 关于图结构的深度优先搜索遍历。。。输出搜索的遍历序列-On the graph structure of the depth-first search traversal. . . Output search traversal sequence. .
shiyan
- 使用Javascr ipt和Applet实现网页版的插入算法、归并算法、堆排序、快速排序、多项式加减（用链实现）、十进制转化为二进制（用队+栈实现）、开放地址法（线性探测）、一次探测法（平方探测）、二次探测法（双HASH）实现快速查找、利用二叉排序树进行排序与查找以及删除一个节点、实现宽度优先或深度优先排序算法、实现Kruskal算法或Prime算法-Insertion algorithm, merging algorithm, heap sort, quick sort, polynomial
GrapeDeep
- 图的深度优先遍历，数据结构的很重要的一个内容，也很有难度，与大家分享-Graph depth-first traversal of the data structure is an important content, but also very difficult to share with you
XGraph2
- 能够建立有向图无向图的邻接矩阵和邻接表表示法，深度优先和广度优先搜索，能够存储和显示相应的搜索结果（深度优先或广度优先生成森林（或生成树）、深度优先或广度优先序列和编号）。以文件形式输入图的顶点和边，并显示相应的结果。-To build a directed graph undirected adjacency matrix and adjacency list representation, depth-first and breadth-first search, to store and
pic
- 对任意给定的图（顶点数和边数自定），建立它的邻接表并输出，然后利用堆栈的五种基本运算（清空堆栈、压栈、弹出、取栈顶元素、判栈空）实现图的深度优先搜索遍历和广度优先搜索遍历算法。 -For any given graph (vertices and edges from the set), to establish its adjacency list and output, and then use the stack of five basic operations (empty stac
graph
- 本程序可实现图的构建，对节点数没有要求，并能实现广度深度优先遍历，-This procedure enables the construction plans, there is no requirement on the number of nodes, and to achieve breadth depth-first traversal,
TileProblem.tar
- This is simulation of classic 15 tile puzzle problem solver. It has capability to solve the problem using artificial intelligent techniques of depth first search and A-star search. This project is completely done in netbeans for running game requ
Learning-depth-information
- 本文提出一种基于高斯- 马尔科夫 随机场模型，首先通过图像采集及激光测距系统，采集大量图像及其相匹配的深度信息图，在 人类视觉系统基础上，提取图像特征，通过训练完善模型，并应用于新采集图像上-This paper presents a Gauss- Markov random field model, first by image acquisition and laser ranging system, collecting a large number of images to ma
Diagnosis-Expert-System
- 采用人工智能专家系统计算机技术模拟故障诊断领域专家的推理思维方式, 对机械设备发生的故障实现迅速准确的 诊断,同时缩短故障停机时间具有重大意义。本文应用Visual prolog 语言,构造了转子系统故障诊断专家系统,提出了一阶谓 词逻辑子句表达知识的方法,建立了专家知识库。系统的推理机采用深度优先的推理策略。应用表明系统有效完成旋转机械 常出现的十多种故障的诊断,并运行可靠。-The computer technology of artificial intelligence ex
BFSandDFS
- 使用C语言编写的对与邻接矩阵无向图的输出及深度优先遍历和广度优先遍历实现源代码有demo测试图片，对于理解邻接矩阵无向图有很大帮助-Written using C and the adjacency matrix of undirected graph of output and depth-first traversal and breadth-first traversal with demo source code to achieve the test images, for under
BFSandDFSList
- 对数据结构中图一部分采用邻接表实现无向图的建立、深度优先遍历和广度优先遍历算法实现，成功运行，有测试数据-Part of the data structure used in the adjacent table to achieve the establishment of an undirected graph, depth-first traversal and breadth-first traversal algorithm, the successful operation, a t
PBFSandDfsList
- 数据结构中对有向图采用邻接表为存储结构实现对有向图的建立、深度优先遍历和广度优先遍历，同样有测试数据-Data structure of a directed graph with adjacency table for the storage structure to achieve the establishment of a directed graph, depth-first traversal and breadth-first traversal, the same test da