搜索资源列表
Adjacency-matrix
- 利用邻接矩阵实现图的遍历，C++源代码，能通过编译。-Using adjacency matrix of graphs can traverse, c++ source code, can to compile.
get_clustering_coefficient
- 通过邻接矩阵，计算网络的聚类系数。聚类系数是复杂网络中一个重要参量。 -Through the adjacency matrix, computing networks, clustering coefficient. Clustering coefficient is a complex network, an important parameter.
graph
- 图的各种存储结构，特别要熟练掌握邻接矩阵和邻接表存储结构。 遍历是图各种应用的算法的基础，要熟练掌握图的深度优先遍历-Map a variety of storage structures, in particular to master the adjacency matrix and adjacency list storage structure. Graph traversal is a wide range of applications based on algorithms,
ShortestPaths
- Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a product of all the edges in the path. The weights are rational numbers (e.g., 0.25, 0.75, 3.75 etc) or integers (2, 3). There are no negative edges.
EdgeDisjointCycles
- Edge Disjoint Cycles. You are given an input graph that is either directed or undirected. Write a program that reads in a vertex number and lists the number of edge disjoint cycles that start and end at this vertex. The output should also list the ed
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.
shixiantudebianli
- MatToList(MGraph g,ALGraph *&G)：将邻接矩阵g转换成邻接表G。 ListToMat(ALGraph *G,MGraph &g)：将邻接表G转换成邻接矩阵g。 DispMat(MGraph g)：输出邻接矩阵g。 DispAdj(ALGraph *G)：输出邻接表G。 DFS(ALGraph *G,int v)：以递归的方法从顶点v深度优先遍历图G。 =
Adacency-Matrix
- 利用C++实现图的邻接矩阵的存储，这在网络流的计算中有很大的帮助。-Using C++, adjacency matrix of storage, which in the calculation of network flow is very helpful.
Adjacency-matrix
- 使用C语言实现的邻接矩阵，程序中使用了数据结构和算法的一些简单的知识。-Using C language of the realization of the adjacency matrix, and the program was used in data structure and algorithms of some simple knowledge.
using-adjacent-matrix-to-store-graph
- 用C语言数据结构描述的演示用邻接矩阵存图的小程序-Described in C language data structures stored adjacency matrix of graph presentation with a small program
MATRIX-
- 无向图的关联矩阵和邻接矩阵相互转化,代码简单易懂，有详细注释，适合初学者入门使用。- incidence matrix of and adjacency matrix transformation
Graph(adjacency-matrix)
- 使用邻接矩阵作为存储结构构造图，并完成图的建立，深度遍历，广度遍历-Use the adjacency matrix as a storage structure structure diagram, and complete the establishment of the Figure, deep traversal, breadth traversal
adjacency-matrix
- 输入一个邻接矩阵输出该邻接矩阵的可达性矩阵-Input an adjacency matrix output reachability matrix of the adjacency matrix
adjacency-matrix-connectivity
- 邻接矩阵连通性的判定，介绍了一种新的图的连通性算法。-The determination of the adjacency matrix connectivity
adjacent-matrix
- Matlab 读取txt中的network data并转化为邻接矩阵-Matlab read txt the network data and converted into an adjacency matrix
Adjacency-matrix
- 分别以邻接矩阵和邻接表的存储结构建立图。 分别对图进行深度优先遍历和广度优先遍历。 求图中边的数目。 求顶点0到图中其余每个顶点的最短路径-Respectively adjacency matrix and adjacency list storage structure created map. Respectively graph depth-first traversal and breadth-first traversal. In the figure, the numbe
Adjacency-matrix-traversal
- 邻接矩阵遍历，可以实现邻接矩阵的深度和广度遍历-Traverse the adjacency matrix, adjacency matrix can achieve the depth and breadth traversal
Adjacency-Matrix
- 图的邻接矩阵 邻接矩阵（Adjacency Matrix）：是表示顶点之间相邻关系的矩阵。设G=(V,E)是一个图，其中V={v1,v2,…,vn}。G的邻接矩阵是一个具有下列性质的n阶方阵：-Adjacency Matrix
adjacency matrix
- matlab程序，其功能为将邻接表转换为邻接矩阵，非常方便。(Matlab program, its function is to convert adjacency table to adjacency matrix, very convenient.)
adjacency matrix to represent the graph
- (1)使用邻接矩阵表示图，定义相应的抽象数据类型。 (2)实现两个图ADTs的上述函数。 (3)从空图开始，生成图形对象表示图1所示的图形，将顶点和边逐一插入。 (4)以BFS方式遍历图。((1) Use adjacency matrix to represent graphs and define the corresponding abstract data type. (2) Realize all the above functions for the two graph AD