搜索资源列表
图的遍历
- 数据结构中关于图的遍历，任意建节点，深度优先和广度优先两种方法-data structure on the map traverse, arbitrary nodes built, the depth and breadth of priority priority two methods
sting7.doc
- 图的邻接矩阵、邻接表、十字链表、邻接多重链表存储结构表示及其创建算法的c语言实现 图的深度优先搜索遍历算法和图的广度优先搜索遍历算法及C语言实现-the adjacency matrix, the adjacent table, Cross Chain, Listless multiple adjacent storage structure and said the creation algorithm in C Language map of the depth-first traversa
javamigong
- java Labyrinth game；Provides two kinds to produce map s way stochastically: The stochastic distribution point method and the chart depth first traversal the law two kinds.It can searches the shortest way to demonstrate automatically
图的遍历演示
- 一． 问题描述很多涉及图上操作的算法都是以图的遍历为基础的。试写一个程序，演示在连通的无向图上访问全部节点的操作。二． 基本要求以邻接多重链表为存储结构。实现连通无向图的深度和广度优先遍历。以用户指定的节点为起点，分别输出每种遍历下的节点访问序列和相应生成树的边集。-one. Descr iption many issues involving maps of algorithms are to traverse the map-based. A written test procedures,
Kinect_NICV 读取kinect深度和彩色图像
- 读取kinect深度和彩色图像，采用openCV显示，进行手势识别，手跟踪-read the depth and color map from kinect and display by opencv. Recognize gesture and track hand
picture
- 实现图的遍历。对图的深度和广度的遍历，建立邻接矩阵与邻接表-The realization of graph traversal. To map the depth and breadth of the traverse, the establishment of adjacency matrix and adjacency list
dfstraverse
- 完成输入图，然后进行图的深度优先遍历-Complete the input map, and then proceed to map the depth-first traversal
graph
- 图的各种存储结构，特别要熟练掌握邻接矩阵和邻接表存储结构。 遍历是图各种应用的算法的基础，要熟练掌握图的深度优先遍历-Map a variety of storage structures, in particular to master the adjacency matrix and adjacency list storage structure. Graph traversal is a wide range of applications based on algorithms,
1_12_fog
- 12. 在雾中绘制一个立方体,用<C>键控制雾颜色的变化,用<N>键控制雾浓度的变化(0.0-1.0).用<E>键控制雾的开和关. 用<PageUp>和<PageDown>键控制立方体所在的深度-12. In the mist of a cube map, using key control fog <C> color changes, with keys to control fog <N> concentra
graph
- 数据结构C对图的操作算法，有广度、深度优先遍历，拓扑排序，最短路径的实现算法，最小生成树的算法-C data structures to operate on the map algorithm, there is the breadth, depth-first traversal, topological sorting, shortest path algorithm, minimum spanning tree algorithm
f.doc
- 题目1：图的建立与遍历；连通网的最小生成树生成实现。 内容： 1） 用邻接表表示方法建立图1所示图的存储结构，用邻接矩阵存表示方法建立图2所示网的存储结构。 2） 在图1 存储结构（邻接表）上实现深度优先搜索遍历和广度优先搜索遍历，并给出遍历结果（序列）。 3） 按照普里姆算法，在图2所示连通网的存储结构（邻接矩阵）上实现此网的最小生成树，并输出生成树。 -Title 1: Map of the establishment and ergodicity conne
tu_bianli
- 利用C语言实现数据结构中的图的建立,根据边的数目建立图,并用深度遍历法遍历图等-The use of C language data structure diagram of the establishment, in accordance with the number of edge-building plans, and the depth of traversal method traverse map
tu
- 图的建立以及深度遍历，该代码很简单，是用链式存储的-Map-building, as well as the depth of traversal, the code is very simple, with chain store
graph1
- 图的运算，有全图的无权图的广度深度优先遍历-Figure computing, there is no right to map the entire map of the breadth of depth-first traversal
712
- 编写一个算法程序实现： 1、 用邻接表存储下图： 2、完成对以上图的深度优先搜索，设出发顶点是V1。 -Procedures for the preparation of an algorithm to achieve: 1, with adjacent storage under the map table: 2, completion of the above graph depth-first search, set the start
tudebianli
- 图的遍历和生成树求解实现（邻接矩阵、邻接表 ―图的深度广度遍历算法的实现和最小生成树PRIM和KRUSCAL算法的实现） -Graph Traversal and Spanning Tree Solution implementation (adjacency matrix, adjacency list- map the depth of breadth traversal algorithm and implementation of the minimum spanning tree al
TLBB
- 天龙八部定点打怪jj-update版 脚本说明：【功能说明】 前几天发的yy(远攻)版，由于不需要主动出击，所以实现比较容易，但是jj(近攻)版，由于受到怪的图像大小和站位的影响导致了回原点公式需要再减去偏移量L即：1024-x-l，768-y-l，并且容易产生误差，所以我又发表了一个关于如何读取小地图坐标的求助帖子，并且受到了乌白菜兄台的启发，用一种比较简单的方法解决了jj(近攻)版的精确度问题。 【使用说明】 运行脚本前，先按TAB打开地图，再按“—”缩小地图 【作者介绍】
tu
- 图的深度优先遍历，数据结构实验，源码可运行-Map depth-first traversal, the structure of the experimental data, source code can be run
ball_catcher
- This includes the project using a stereo vision to catch the ball shot from a high pressure air cannon. The trajectory of the ball is located first by finding the ball color in the left and right camera. Then the trajectory is calculated to estimate
65
- 建立一个图后，对图进行深度优先遍历后输出-After the establishment of a plan to map the output after the depth-first traversal