搜索资源列表
shortestpath_java
- 用java实现的最短路径dijkstra算法，用邻接矩阵实现-used to achieve-the shortest path algorithm used to achieve adjacency matrix
GraphMatrix
- 以邻接矩阵作为图的存储结构，根据键盘输入创建图，并深度优先、广度优先遍历该图-matrix as to the adjacent storage structure of the plan, according to the keyboard input to create map and depth of priority, breadth priority traversal of the plan
20060824
- 最大团解决方案的PDF文件,学位论文! 名字:一种借助邻接矩阵求任意图最大团的方法.rar-largest corporations solutions PDF files, graduate thesis! Name : using a matrix adjacent to the largest group plans arbitrary way. rar
MCRGSA
- MCRGSA------组播路由问题遗传模拟退火算法 ％M-----------遗传算法进化代数 ％N-----------种群规模，取偶数 ％Pm----------变异概率调节参数 ％K-----------同一温度下状态跳转次数 ％t0----------初始温度 ％alpha-------降温系数 ％beta--------浓度均衡系数 ％ROUTES------备选路径集 ％Num---------到各节点的备选路径数目 ％Cost-------
asdfasxa32
- 掌握图的邻接矩阵的存储结构；实现图的两种遍历：深度优先遍历和广度优先遍历。-master plan adjacency matrix storage structure; Implementation plans of the two traverse : depth-first traversal and breadth traversal priority.
operate
- 1，图的建立与遍历操作 建立图的邻接矩阵 输出图从顶点V0出发按深度优先遍历的顶点序列 输出图从顶点V0出发按广度优先遍历的顶点序列 2，图的建立与拓扑排序-1, Graph traversal operation with the establishment of the establishment of the adjacency matrix output plans starting from the vertex V0 by depth-first traversal
excellentwaysofshortpath
- 程序的主要功能是实现有向图最短路径的搜索，采用的数据是txt格式的邻接矩阵，采用的算法为改进的狄氏算法。内附调试和文件说明。-procedures main function is to achieve the shortest path to the map search, The data format is txt adjacent matrix, the algorithm to improve the dieldrin algorithm. Debugging and document
tusuanfa
- 用vc++6.0实现图－邻接矩阵-最短路径.数据结构课程必备，有一定参考价值。-with vc 6.0 map-adjacency matrix-shortest path. Data structure courses required that a certain reference value.
GetMatrix_java
- 一个由邻接矩阵直接求解可达矩阵的计算工具，JAVA语言编程-an adjacency matrix directly by solving matrix up to the calculation tools, Java Programming Language
Diagram
- 图的操作,包括,图的基本存储方法,有关图的操作算法并用C语言编程实现,图的搜索路径的遍历方法,以邻接矩阵和邻接表的方式存储连通图。然后分别用优先深度算法遍历邻接矩阵方式存储的图和邻接表方式存储的图。深度优先遍历的递归算法 （1）深度优先遍历算法（2）邻接表表示的深度优先搜索算法（3）邻接矩阵表示的深度优先搜索算法.-plan of operation, including, map the basic storage methods, the operation of the map algor
ljjzqdt
- 用于数据结构的课程设计,是利用邻接矩阵建立图的-data structure for the curriculum design is the use of adjacency matrix establish map
tutrav
- 此程序用来求图的遍历问题……题中采用的是图的邻接矩阵存储-the procedure used to plan for the traversal issue ... that is used in the adjacency matrix storage
PerTravel_Tree
- 用图的邻接矩阵存取，来进行图的前序遍历-with the adjacency matrix access, plans to conduct the first preorder
2007char
- 利用邻接矩阵的图深度优先遍历算法，调试通过，无毒！-use of adjacency matrix plans depth-first search algorithm, through testing, drug-free!
tudelinjiejuzhenjiegouzhuanweilinjielianbiaojiegou
- 关于图的邻接矩阵结构转为邻接链表结构算法的相关的用c语言编写的一个源程序代码-on the adjacency matrix structure adjacent to the list structure of the algorithm used to prepare the language c a source code
masm4
- 该程序用于用邻接矩阵存储图的结构,该程序用于用邻接矩阵存储图的结构-procedures for the use of adjacency matrix storage map structure, the procedures for the use of adjacency matrix structure of the storage plan
dijkstra_simple
- 一个简单的Dijkstra算法的实现,用一个数组来表示邻接矩阵-a simple realization of the Dijkstra algorithm, using an array said adjacency matrix
adjlist
- 邻接矩阵转化为邻接表 vc编程基础，学生作业-adjacency matrix into adjacent table vc based programming, students work
sting6.doc
- 普里姆构造最小生成树算法 图或网的邻接矩阵表示及其上基本算法的实现-prim minimum spanning tree algorithm tectonic map of the network or matrix and adjacency on the realization of basic algorithm
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