搜索资源列表
邻接矩阵求解最短路径(数组)
- 邻接矩阵求解最短路径(数组).rar 邻接矩阵求解最短路径(数组).rar-adjacency matrix for the Shortest Path (arrays). Rar adjacency matrix for the Shortest Path (arrays). Rar
复杂网络邻接矩阵直接转化为Pajek
- 一个可以把Matlab复杂网络邻接矩阵直接转化为Pajek可以识别的网络文件(.net)很实用,学习复杂网络的可以下载-a programme that can transform the adj_matrix in matlab into .net file that pajek can recognize
用 Floyd 算法求任意两点间的最短路径及最短路长
- 用 Floyd 算法求任意两点间的最短路径及最短路长. D0 是图的邻接矩阵,Floyd algorithm used for any shortest path between two points and the most long-short-circuit. D0 is the graph adjacency matrix
Prim.rar
- 用普里姆(Prim)算法求用邻接矩阵存储结构表示的图或网的最小生成树,With the prim algorithm is seeking to use adjacency matrix storage structure, said the plan or network, minimum spanning tree
get_clustering_coefficient
- 通过邻接矩阵,计算网络的聚类系数。聚类系数是复杂网络中一个重要参量。 -Through the adjacency matrix, computing networks, clustering coefficient. Clustering coefficient is a complex network, an important parameter.
2
- 一种求邻接矩阵的普通算法,这是通用程序,要注意变量的更改。-A Method for the adjacency matrix of the general algorithm, which is common procedure, to pay attention to the variable changes.
邻接矩阵表示图
- 用邻接矩阵存储表示图的结构,采用的是深度优先算法
fenzhi
- 通过分支限界的方法,求解1到n的最短路径。设数组a保存图的邻接矩阵,0-9号,共10个节点。节点1为源点,n为目标点.-Through the branch and bound approach for solving 1 to n shortest path. A preservation plan for an array of adjacency matrix ,0-9, a total of 10 nodes. Node 1 is the source, n for the target
DataStruture-Graph
- 1.7.1 图的邻接矩阵存储表示 311 范例1-102 图的邻接矩阵存储表示 ∷相关函数:CreateFAG函数 CreateDG函数 1.7.2 图的邻接表存储表示 324 范例1-103 图的邻接表存储表示 324 ∷相关函数:CreateFAG函数 1.7.3 有向图的十字链表存储表示 335 范例1-104 有向图的十字链表存储表示 335 ∷相关函数:CreateDG函数 1.7.4 无向图的邻接多重表存储表示 344 范例1-105 无向图
create_graphic
- 图的建立,有多种的图可以选择,也可以选择图的遍历方法,里面的图的存储结构是以顶点数组和邻接矩阵的方式存储的。-Map-building, there are several plans to choose, you can choose to graph traversal method, which the storage structure of the plan is based on vertex adjacency matrix of the array and stored the.
tudexg
- 1.邻接表创建图 2.打印图的信息 3.深度优先遍历图 4.最小生成树 5.邻接矩阵创建无向网-1. Adjacency table to create Figure 2. Print map information 3. Depth-first traversal Figure 4. Minimum Spanning Tree 5. Adjacency matrix to create a non-network
code
- 学习数据结构时编写的有关二叉树基本运算实现,有向图和邻接矩阵,邻接表的转换,输出某矩阵转置矩阵的三元组以及两矩阵进行运算后结果用三元组表示,在学习VC程序设计写了一个简单的机场不同型号车辆的收费系统。-Learning data structures to prepare basic operations on binary tree realization of a directed graph and the adjacency matrix, adjacency list of the c
Graph
- 1.建立无向网的邻接矩阵。 要求:从键盘输入无向网的顶点数和边数;然后以“顶点1,顶点2,权值”的方式输入图的各边,建立邻接矩阵存储,并输出各顶点和邻接矩阵。 2.对无向网进行深度优先遍历,输出遍历序列。 3.判断给定的无向网是否是连通的? 要求:从键盘上输入出发点进行搜索遍历,输出遍历序列。 -1. The establishment of the network adjacency matrix. Requirements: No input from the ke
file
- 将图的数据写入文件并构造邻接矩阵,求出单源点到其他顶点的最短路径(The data of the graph is written into the file and the adjacency matrix is constructed, and the shortest path from the single source point to the other vertex is found)
迪杰斯特拉求最优路径
- 根据邻接矩阵,使用迪杰斯特拉法找出两点的最优路径节点和总距离(According to the adjacency matrix, Dijkstra method is used to find the optimal path node and total distance of two points)
邻接矩阵
- 邻接矩阵,描述多个节点之间的相邻关系,最多16个(Adjacency matrix, describing the adjacent relations between multiple nodes, up to 16)
邻接矩阵与邻接表相互转化
- 数据结构图论部分,邻接矩阵转邻接表,用C语言实现,再加几个字才够20字(The data structure graph, adjacency matrix to the adjacency list, using C language, plus a few words to 20 words)
第三次实验课(1)
- 1、定义邻接矩阵存储的图类Graph_Matrix . 2、实验验证如下算法的正确性、各种功能及指标: 1)创建一个邻接矩阵存储的图; 2)返回图中指定边的权值; 3)查找图中某顶点的第一个邻接顶点、某顶点关于另一个顶点的下一个邻接顶点序号; 3、4)图的深度优先遍历; 5)基于普里姆算法求最小支撑树。【选作】(1. Define the graph class Graph_Matrix which is stored by the adjacency matrix. 2. The
linjiejuzhen
- 对新加入节点之后的网络的邻接矩阵进行修改并保存。(The adjacency matrix of the new join node is modified and saved.)
无向图
- 无向图的创建,转化为邻接矩阵输出,及深度、广度优先遍历(The creation of undirected graph is transformed into adjacency matrix output and depth and breadth first traversal.)