搜索资源列表
mintreePrim
- Dandn文件给出了输入参数的名称及格式 即在调用prim前先输入邻接矩阵D和节点个数n 输入prim 得到两行的矩阵T,将上下两行数字对应的节点相连即可-Dandn document gives the name of the input parameters and format Prim in the call prior to the importation of adjacency matrix D and the node number n Input pri
shortest_path_adjacencyWDigraph
- 采用动态规划法，构建邻接矩阵带权有向图，解决最短路径问题。-Dynamic programming method used to construct adjacency matrix weighted directed graph, the shortest path to solve the problem.
ER
- 复杂网络ER随机网络的C++代码，可求其邻接矩阵和聚类系数-ER random networks of complex networks C++ code, rectifiable its adjacency matrix and clustering coefficient
Dijkstra
- 图与网络论中求最短路径的Dijkstra算法 M-函数 格式 [S,D]=minroute(i,m,W) i为最短路径的起始点,m为图顶点数,W为图的带权邻接矩阵， 不构成边的两顶点之间的权用inf表示。显示结果为：S的每 一列从上到下记录了从始点到终点的最短路径所经顶点的序号； D是一行向量，记录了S中所示路径的大小 -Graph and network theory Dijkstra' s shortest path algorithm M-functio
ACA_QoS_MR
- ACA_QoS_MR时蚁群算法在组播路由中的应用，输出最优组播树（01邻接矩阵表示）,最优组播树所有的边,最优组播树的费用-ACA_QoS_MR ant colony algorithm for multicast routing output optimal multicast tree (01 adjacency matrix), all the edges of the optimal multicast tree, the optimal multicast tree cost
netplot
- 复杂无向图网络绘图，包括处理邻接矩阵和关联矩阵，具体使用方法可以通过help netplot查询。-Complex network undirected graph drawing, including processing adjacency matrix and incidence matrix, the specific method of use can help netplot queries.
lfm
- 重叠社区发现LFM算法，基于python实现，导入的文件是lfr基准测试网络，里面写了检测指标，文件可更改，算法通过网络邻接矩阵来实现社区划分(The overlapping community found the LFM algorithm, based on the python implementation, the imported document is the LFR benchmark network, in which the detection index is written