搜索资源列表
7-2-1
- 图的基本运算，包括邻接矩阵，邻接表存储。还有图的深度优先，广度优先算法，老师写的-Map basic operations, including the adjacency matrix, adjacency list is stored. There are also a depth-first, breadth-first algorithm, the teacher wrote
graph.yangxu
- 熟悉图的存储方式，实现图的邻接矩阵或者邻接表的存储方式下的基本运算，特别是深度遍历和广度遍历；掌握以图为基础的一些常用算法，如最小生成树、拓扑排序、最短路径等。-Familiar with the map of storage practices, and achieve adjacency matrix or adjacency list is stored under the basic operations, especially in the depth and breadth trav
ShadowMap
- Opengl超级宝典阴影贴图的例子，例子利用深度缓冲区实现阴影贴图。-Opengl Super Bible examples of shadow maps, examples of using the depth buffer to achieve a shadow map.
tu
- 用C语言编程一个有向图如下，功能要求如下：输入并生成该图；深度优先遍历；广度优先遍历； -With the C programming language as a directed graph, functional requirements are as follows: input and generate the map depth-first traversal breadth-first traversal
MapCreation
- 图的创建，深度优先和广度优先搜索，有实验报告-Map creation, depth-first and breadth-first search, there are experimental reports
graph
- 可以实现深度和广度的查询，同样也可以图计算出它的邻接矩阵和邻接表-Can achieve the depth and breadth of the inquiry, as it can map to calculate the adjacency matrix and adjacency list
bianli
- 用邻接矩阵确定图 输出深度优先遍历和广度优先遍历的结果-Map with the adjacency matrix to determine the depth first traversal and breadth of the output first traversal of the results
embeddedlinuxbootinformation
- 嵌入式 linux 的启动信息是一个很值得我们去好好研究的东西，它能将一幅缩影图呈现在我 们面前，来指导我们更加深入地理解 linux 内核。 -Linux boot embedded information is a study well worth a good thing, it will be a microcosm of the map in front of us, to guide us more in-depth understanding of linux kernel.
graph
- 图子系统实验，定义了图的存储结构，以及队列操作。包括邻接矩阵，深度优先遍历，以及广度优先遍历-Figure subsystem test, defines the memory structure map and queue operations. Including the adjacency matrix, depth-first traversal and breadth-first traversal
graph
- 用邻接表的方式建立一个图，可以对这个图进行删除边，增加边，删除增加节点，和深度广度优先搜索-With the adjacency list of ways to build a map, you can delete the edges of this graph, increasing side, remove the added nodes, and depth of breadth-first search
vcgraphic
- 电子地图，初级，大家互相学习下吧，有什么深入探讨QQ联系-Electronic map, primary, everyone s mutual learning it, what depth QQ connection
sdkamfc
- 包括对sdk和mfc的基本讲解，比较细致和深入，附加一个vc实习项目-校园导游图-Including mfc sdk and basic explanations, more refined and in-depth, attach a vc internship program- Campus Tour Map
DSFGraphaprim-MST
- 深度优先遍历图，并用kruscal算法求最小生成树-Depth-first traversal map, and for the Minimum Spanning Tree with kruscal
tuzixitong
- 一个生成图的程序，并对图进行深度广度等遍历，整合的一个系统的应用-Generated map of a program, depth and breadth graph traversal, the application of a system integration
TU2
- 编写程序以邻接矩阵或邻接表的方式存储指定连通图。然后分别用深度优先算法和广度优先算法遍历邻接矩阵方式存储的图和邻接表方式存储的图。-Write a program to the adjacency matrix or adjacency list stored in a manner specified connected. Then were used to depth-first traversal algorithm and the breadth-first algorithm stor
biaomiantu-and-breakdancer
- 基于matlab的多参考视点表面图的算法 和基于深度图像的虚拟视点生成主程序 -Matlab-based multi-view reference map of the algorithm and the surface of the depth of the main program generated virtual view images
01.x264_main_dataflow
- 深入理解x264算法的重要文章，对x264每个函数都做了详细的描述，对整体流程也用图的形式加以表达，对想真正弄懂算法的朋友很有帮助-In-depth understanding of important articles x264 algorithm, each function of the x264 have done a detailed descr iption of the overall process is also used to map the expression of th
02.x264_cavlc_dataflow
- 深入理解x264算法的重要文章之2，对x264每个函数都做了详细的描述，对整体流程也用图的形式加以表达，对想真正弄懂算法的朋友很有帮助-In-depth understanding of important articles x264 algorithm, each function of the x264 have done a detailed descr iption of the overall process is also used to map the expression of
graph(linjiejuzhen)
- 基于C++模板，用邻接矩阵的方式，实现了基本的Graph(map)的构建，并实现了深度优先搜索和广度优先搜索，同时加入了测试用的数据读入和写入函数，便于调试和在本代码基础上进行进一步扩充。-Based on C++ templates, adjacency matrix, enabling a basic Graph (map) to build and achieve a depth-first search and breadth-first search, also joined the
CSharp---DFS-BFS
- 实现图的交互输入，可创建邻接表，还可进行深度优先遍历广度优先遍历，拓扑排序等-To achieve interactive map input, you can create adjacency table, but also for the breadth-first traversal depth-first traversal, topological sorting