搜索资源列表
aihed
- 一个由邻接矩阵直接求解可达矩阵的计算工具,JAVA语言编程(The solution to a directly by adjacency matrix matrix calculation tool, the JAVA programming language)
BetweennessVerte
- 根据邻接矩阵,计算复杂网络中节点的介数。(According to adjacency matrix, Calculate the Betweenness of network nodes)
归档
- floyd简单算法 输入邻接矩阵即可,算法较快,无需等待!(Floyd simple algorithm, enter the adjacency matrix can be)
adjacency matrix
- matlab程序,其功能为将邻接表转换为邻接矩阵,非常方便。(Matlab program, its function is to convert adjacency table to adjacency matrix, very convenient.)
MST
- 输入邻接矩阵,输出MST算法所得过滤结构子图。(Input the adjecent martix, outpur the MST.)
35886235
- 一个由邻接矩阵直接求解可达矩阵的计算工具,JAVA语言编程()
Ant Colony Algorithm
- 基于蚁群算法的机器人路径规划,使用网格离散化的方法对带有障碍物的环境建模,使用邻接矩阵存储该环境,使得问题转化为蚁群算法寻找最短路径。(Based on the ant colony algorithm, the path of the robot with the obstacle is modeled by the method of grid discretization, and the environment is stored by the adjacency matrix, so
raser
- 一个由邻接矩阵直接求解可达矩阵的计算工具,JAVA语言编程()
最小生成树Prim算法
- Dandn文件给出了输入参数的名称及格式 即在调用prim前先输入邻接矩阵D和节点个数n 输入prim 得到两行的矩阵T,将上下两行数字对应的节点相连即可(The Dandn file gives the name and format of the input parameter That is, before entering prim, the adjacency matrix D and the number of nodes n are input Input prim G
lanzhouroad
- 兰州道路交通网络信息查询。设计一个简单的能够实现兰州道路交通网络信息查询功能的系统。兰州道路交通网采用邻接矩阵(或邻接表)表示,包括道路交通网邻接矩阵(或邻接表)的建立、路径(或时间)的查询、最短路径(或最短时间)的查找、显示输出等功能;兰州道路交通网中顶点表示地名、图上的弧表示两地之间有路径存在、弧上的权值表示两地之间的距离(或时间)(Information query of road traffic network in Lanzhou. Design a simple system tha
floyd
- 输入拓扑网络的邻接矩阵,即可输出所有任意两点之间的最短距离及最短路径。(The adjacency matrix of the topological network can be used to output the shortest distance between any two points and the shortest path.)
加强图
- 图 深度优先搜索遍历和 邻接矩阵,闫蔚敏版,简单易懂,适合平时交作业(Graph depth first search and adjacency matrix, Yan Yumin version, simple, suitable for everyday homework)
新建文本文档
- 最短路径算法,/邻接矩阵法图的生成函数的最短路径算法,并生成打印图的结点标识符和邻接矩阵(The shortest path algorithm to generate the adjacency matrix of the graph function, and generate the node identifier and the adjacency matrix print map)
irogramprint
- 对任意给定的网络顶点数和边数自定,建立它的邻接矩阵并输出,然后利用Prim算法或Kruskal算法生成它的最小生成树,()
JUDGE
- 判断两个邻接矩阵是否为同构图,1表示是同构图,0表示不是(Determine whether two adjacency matrices are isomorphic graphs, 1 are isomorphic graphs, and 0 are not.)
Desktop
- 运用迪杰斯特拉方案,以及邻接矩阵算出最短路径,的程序。。。。。。(The application of the Dijkstra scheme and the adjacency matrix to calculate the shortest path.)
5268140
- 通过对角线 轮系拓扑判断两个分层邻接矩阵和图形的一致性()
Graph
- 利用邻接矩阵构建图,为学习数据结构的同学提供基本的代码(Building graphs by adjacency matrix, providing basic code for students learning data structures)
最小生成树
- C++最小生成树算法,提供给算法爱好者学习,有图的基本概念,邻接矩阵,prim算法等(Minimum spanning tree algorithm)
Tree_Graph
- 本工程包含二叉树和图的相关基本操作,源码包括二叉树的前序、中序、后序、层次遍历,求树高和树宽,创建、删除二叉树或某个结点,通过前序和中序序列得后序序列;图的创建(邻接矩阵或邻接表表示),深度优先和广度优先搜索,求关键路径,普里姆算法求最小生成树等,放到Visual C++工作区即可使用。(This project contains the basic operation of the binary tree and the graph. The source code includes the