搜索资源列表
MGraph
- 实现的是以邻接矩阵存储图,并能将矩阵打印,同时实现了图的深度遍历
MGraph
- 实现的是以邻接矩阵存储图,并能将矩阵打印,同时实现了图的深度遍历-Adjacency matrix based on the realization of the storage map, and can matrix printing, at the same time realize the depth of the graph traversal
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
ajax-MGraph-v096
- test application ajax file
mxgraph-eval-1_0_1_0
- mgraph-强大的web绘图组件,可绘制工作流、数据库ER图、网络拓扑图等,基于Javascr ipt/Java/.Net-mgraph-powerful web mapping components, can draw the workflow, database ER diagrams, network topology maps, etc., based on Javascr ipt/Java/.Net
MGraph
- 已知图的结点和权值,求初始结点到目标结点的最短路径-Known to map node and weight, find the initial node to the destination node of the shortest path
MGraph
- 用克鲁斯卡尔算法实现的最小生成树代码,要输入边的信息,每条边的信息包括两个顶点号(从1开始)及权值。在这个程序里顶点信息不太重要,只是用一个字符保存的,如需要可自己更改。-create a minimum tree use the Kruskal arithmetic.
mgraph-based
- 基于图像的图像分割代码,用于找到最小区分边-graph-based segmentation
CPP--MGraph
- 《数据结构》课程中,图的邻接矩阵存储,用C/C++编程实现。-Data structure course, graph the adjacency matrix storage, use C/C++ programming realization
mgraph
- 数据结构,图储存结构的算法,包括深度遍历,广度遍历等-Data structure, storage structure of the algorithm
mgraph
- 图的某些功能实现,包括最短路径的遍历,图的全遍历,图的更新,删除节点,增加节点,边之类-some functions about the mgraph!!!
MGraph
- 二叉树的广度优先遍历和深度优先遍历,详细说了是如何运行的-Breadth-first and depth-first traversal of a binary tree, said how to run. .
MGraph
- 是数据结构中图的实现算法,是用二维数组实现的,用C语言写的。希望能给大家一个参考-Is a data structure diagram of the algorithm is implemented using two-dimensional array, using C language. I hope to give you a reference
MGraph
- 图的存储。采用了邻接链表法。节点保存边的另一个顶点的下标和权值。-FIG storage. Using adjacency list method. Index and vertex weights another node holds the edge.
mgraph
- 图的基本操作: 创建(有向图、无向图、有向网、无向网) 顶点、路径(The basic function of Mgraph.)