搜索资源列表
邻接矩阵求解最短路径（数组）
- 邻接矩阵求解最短路径（数组）.rar 邻接矩阵求解最短路径（数组）.rar-adjacency matrix for the Shortest Path (arrays). Rar adjacency matrix for the Shortest Path (arrays). Rar
有向图从邻接矩阵转换为邻接表后的dfs
- 有向图从邻接矩阵转换为邻接表后再深度优先遍历-a graph from the adjacency matrix conversion of the adjacent#$#!142996#!#$read IntelCPU serial number. Rar!#$#read Intel CPU serial number. Rar read Intel CPU serial number. Read rar Intel CPU serial number. rar
邻接矩阵求最短路径
- 邻接矩阵的最短距离-adjacency matrix is the shortest distance
复杂网络邻接矩阵直接转化为Pajek
- 一个可以把Matlab复杂网络邻接矩阵直接转化为Pajek可以识别的网络文件（.net）很实用，学习复杂网络的可以下载-a programme that can transform the adj_matrix in matlab into .net file that pajek can recognize
数据结构图的邻接矩阵,邻接表存储表示，图的深度优先搜索遍历，广度优先搜索遍历
- 数据结构图的邻接矩阵,邻接表存储表示，图的深度优先搜索遍历，广度优先搜索遍历
BA 求其邻接矩阵和聚类系数
- 复杂网络BA无标度网络的C++代码，可求其邻接矩阵和聚类系数。-Complex network of BA scale-free network of C++ code, rectifiable its adjacency matrix and the clustering coefficient.
用邻接矩阵解决四色问题
- C语言写的，用邻接矩阵解决四色问题,输入国家的个数和相邻情况，输出每个国家的颜色代号。-Adjacency matrix solution with four-color problem, enter the number and neighboring countries the situation, the output color codes for each country.
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.
11
- 随机给出n*n的邻接矩阵，并打印出邻接矩阵，边的个数，回路的个数和每个顶点的度，并判断该图中是否存在Euler回路。-Random given the n* n adjacency matrix and adjacency matrix print, while the number, loop number and the degree of each vertex, and determine the existence of the map Euler circuit.
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)
linjiejuzheng
- 此程序用于将点与点的数据，转化为邻接矩阵形式，需要修改有关参数。(This procedure is used to transform the data of points and points into adjacency matrix form, and the relevant parameters need to be modified.)
net2matrix
- 通过Excel将关联关系通过透视表转换为邻接矩阵(Transform the relational relationship by the perspective table into the adjacency matrix)
邻接矩阵
- 邻接矩阵,描述多个节点之间的相邻关系，最多16个(Adjacency matrix, describing the adjacent relations between multiple nodes, up to 16)