搜索资源列表
scj_Graph
- 数据结构中有关图的创建，存储显示，深度，广度优先遍历算法，以及最小生成树Prim和Kruscal算法实现-The map data structure to create, store display, the depth, breadth-first traversal algorithm, and Prim minimum spanning tree algorithm and Kruscal
Lying-data-structure9
- 《大话数据结构》主要内容包含：数据结构介绍、算法推导大O阶的方法；顺序结构与链式结构差异、栈与队列的应用；串的朴素模式匹配、KMP模式匹配算法；二叉树前中后序遍历、赫夫曼树及应用；图的深度、广度遍历；最小生成树两种算法、最短路径两种算法；拓扑排序与关键路径算法；折半查找、插值查找、斐波那契查找等静态查找；稠密索引、分块索引、倒排索引等索引技术；冒泡、选择、插入等简单排序；希尔、堆、归并、快速等改进排序-" Westward the data structure," the m
dictionary
- 简单词典，界面贴图，想深入的话，可以优化查询算法-Simple dictionary interface map, like in-depth, you can optimize the query algorithm
QXGameEngine0112MMORPG
- Silverlight-MMORPG游戏引擎0112源码 这里要说明的，此完成度约50 的2D-ARPG游戏引擎存在地图未切割、多线程未优化、算法未优化、无寻路等诸多毛病， 总结原因是架构上一开始就存在着问题，因此我不打算对其再进行完善及后续制作了。至于它的开源，或许对所有的朋友有大害而无一益， 那么就让它深藏吧。但是就是因为有了它的存在，才会有了本教程以一个更为优雅、简约时尚的姿态出现。我将在本例中完全屏弃 它所有的弱点，实现它未实现的所有功能，让所有的朋友们均能用WP
DebugALGraph
- 图的深度，广度遍历，两顶点之间的最短路径，-Map the depth, breadth traversal, shortest path between two vertices, etc.
cvFindStereoCorrespondence
- 使用OpenCV cvFindStereoCorrespondence函數，計算出立體視覺影像深度，給予立體視覺左右圖像，啟動程序，即可計算出立體視差圖。-Use opevCV cvFindStereoCorrespondence function to calculate the penetration depth of stereoscopic vision. About to give three-dimensional visual map, start a program that w
201141111175099
- 对数据和地图进行动画开发； 可缩放的界面，包括将来的移动版； 深入整合视频、音频和图像，不仅仅是弹出层； 支持自定义主题的地图控件； -Data and animated maps of the development Scalable interface, including the future of Mobile In-depth integration of video, audio and image, not
Visit-system
- 实现功能：1,从文件读入景点信息道路信息，然后用邻接表建立校园图，用邻接矩阵存放边的信息。 2,查看景点信息，道路信息。 3,查找两点之间最短路径，采用弗洛依德算法。 4,采用深度优先递归调用的方法遍利图。-Functions: 1, read from the file into the attractions road information and the establishment of the campus map, and then use the adjacency l
kinect_samples
- kinect_samples提供了在win7下使用开发，提供了彩色图 ，深度图，人体骨骼获取的方法。-kinect_samples tell you how to use kinect SDK to develop your dome in win7.It obtains color image,depth image and skeleton map.
tu
- 关于图的各种运算，包括图的定义、邻接矩阵、表的定义，图的遍历、求路径和最小生成树、深度和广度生成树等,其中每一个都含main主函数可直接运行测试.-Map operations, including the definition of a graph, adjacency matrix, the definition of the table, graph traversal, and seek the path and minimum spanning tree, breadth and de
linwenzhong-Graphlnk
- 图的存储、遍历及其应用 掌握图的存储表示及基本操作的实现 , 掌握图的深度优先遍历和广度优先遍历的实现,图的邻接表表示，运用C++类实现图的类定义及基本操作算法。-Map storage, traversal and its application to master storage representation of the map and the realization of the basic operations, master graph depth-first travers
1
- 迷宫求解，利用深度优先搜索和非递归算法，地图可随意设置-Maze solving, the use of depth-first search and non-recursive algorithm, the map could be set
tudebianli
- 分别用邻接矩阵和邻接表实现图的深度优先搜索和广度优先搜索-Adjacency matrix and adjacency were used to map the table to achieve the depth-first search and breadth-first search
picture
- 图以矩阵形式存储，以广度优先和深度优先两种方法遍历-Map stored in the form of a matrix, priority to the breadth and depth first two methods traversal
2008021106bianli
- 本代码主要用于建立无向图并输出 深度优化遍历图 广度优化遍历图 还可以退出本系统。-The code is mainly used for the establishment of an undirected graph optimization traversal Figure breadth optimization traverse the map can also exit the system and output depth.
getPath
- 实现的是图的深度搜索算法，随机给出出发点到终点的一条路径，图用邻接矩阵表示-depth search algorithm, giving a random path from starting point to the end point, map is discribed by Adjacency matrix
ms_segmenter
- Image segmentation We propose a segmentation framework that takes as its input a xation (a point location) in the scene and outputs the region containing that xation. The xated region is segmented in terms of the area enclosed by the \optima
edge-detection
- Edge detection We propose a edge detection framework that takes as its input a xation (a point location) in the scene and outputs the region containing that xation. The xated region is segmented in terms of the area enclosed by the \optim
code
- 用于图的深度搜索，得到搜索顺序。已成功。-Used to map the depth search, the search order. Has been successful.
DFStree
- 这是关于图的链接表的深度优先和广度优先搜索的完整代码，希望能给广大的数据结构初学者一点帮助。-This is on the map linked table depth-first and breadth-first search the complete code, hoping to give the majority of the data structures that can help beginners.