搜索资源列表
ShortestPath
- 迪杰斯特拉算法求解最小路径，只用给出节点信息以及邻接矩阵即可求出节点对间最短路径，最短路径存于元胞内。文件中有测试的数据，可以替换。-Dijkstra algorithm minimum path, and the only information given node adjacency matrix you can find the shortest path between nodes, the shortest path within the cellular memory. File
shujujiegou-shangji
- 数据结构上机实验代码，可运行，包括图的遍历，二叉树，邻接矩阵，链表队列等，用于初学者，希望能够帮到你。-Code, data structure, computer experiment can be run, including graph traversal, binary tree, the adjacency matrix, and list the queue, etc., for beginners, the hope can help you.
greedy
- 1）编程实现背包问题贪心算法和最小生成树prim算法。通过具体算法理解如何通过局部最优实现全局最优，并验证算法的时间复杂性。 2）输入5个的图的邻接矩阵，程序加入统计prim算法访问图的节点数和边数的语句。 3） 将统计数与复杂性函数所计算的比较次数比较，用表格列出比较结果，给出文字分析。 4）背包问题的实验数据如下表：n=8,m=110 -1) programming to implement the knapsack problem greedy algorithm and
A_findCity
- 人工智能实验中的利用A*算法实现搜索 利用邻接矩阵实现、-AI experiment using A* search algorithm.
DFS_findCity
- 数据结构深度优先搜索算法解决罗马尼亚问题 利用邻接矩阵-Data structure depth-first search algorithm to solve problems by means adjacency matrix Romania
ISMModel
- 解释结构模型(ISM)的matlab学习程序，通过输入邻接矩阵及其维数，计算出因素的分级，以及可达集、先行集和共同集。-Interpretative Structural Model (ISM) in matlab learning program, by entering the adjacency matrix and its dimension, calculate grading factors, as well as arrive set, first set and a common
tulun
- 通过邻接矩阵求可达性矩阵与距离矩阵，用warshall算法与弗洛伊德算法-Seeking reachability matrix and adjacency matrix the matrix by using warshall algorithm and Floyd algorithm
Dijkstra
- 有向图的邻接矩阵，输入矩阵然后计算点到点的最短路径-Directed graph adjacency matrix, input matrix and calculate the shortest route point to point
5
- 《数据结构》 第5次上机题目 ( 二叉树 图 练习 ) 1．编程实现书P156 ADT Graph 基本操作13个，用邻接矩阵存储结构实现； 2. 哈夫曼树的建立。-" Data Structure" 5th title on the machine (Fig binary exercises) 1. Programming book P156 ADT Graph 13 basic operations, using adjacency matrix storage s
graph-vertex-coloring
- 简单图的染色数尽可能少的顶点染色方案，给定一个简单图，输入邻接矩阵就可以到最少颜色数和染色方案-Simple graph coloring number as little as possible vertex coloring scheme, given a simple graph, adjacency matrix input can to the minimum number of colors and color schemes
COLORING
- 图用邻接矩阵表示，程序逻辑为，首先实现了用于确定一种有效颜色的函数color（），然后，按照深度优先和违反约束则回溯的策略进行搜索。-Map with the adjacency matrix that logic to, first of all to achieve the color used to determine the function of an effective color (), and then, in accordance with the depth-first an
Degree_Distribution
- 计算网络分支数，通过输入邻接矩阵，就可以得到网络分支数。-Calculate the number of branch network, by entering the adjacency matrix, you can get the number of branches network.
shangchuan
- 该段代码是利用自己已有的邻接矩阵，然后通过MATLAB画出复杂网络的拓扑结构-MATLAB adjacency matrix topological structure
zuiduanlusuanfa
- 利用MATLAB读取excel邻接矩阵数据，利用自带函数dist对路网共193个节点循环，求解任意两点间最短路径长度，输出结果是矩阵形式-a good way to calculate the shortest path between two points
traversal
- 1.输入顶点的个数、边的个数、每个顶点的值以及每一条边的信息，构建一个无向图G，并用邻接矩阵存储该图。 2.深度优先遍历第1步中构造的图G，输出得到的结点序列。 广度同上-Diagram breadth-first traversal&&deep first
adj2inc
- 这个程序是计算一个邻接矩阵的关联矩阵的，邻接矩阵到关联矩阵的转换-Function for converting an adjacency matrix to an incidence matrix
Floyd
- 使用Floyd算法，根据无向图邻接矩阵，求两点间最短路径-Floyd path
HuffmanTree-Shortest-Path
- 赫夫曼树的建造过程，以及最短路径算法，有关键步奏的注释，需输入节点数据以及邻接矩阵的内容，注意看主函数-Huffman tree construction process, as well as the shortest path algorithm, the key step-outs comments, data and content needs input node adjacency matrix, note the main function
Minimum-Spanning-Tree
- 使用邻接矩阵生成最小生成树的算法，须输入顶点数目，顶点数据以及邻接矩阵的数据。-Adjacency matrix generated minimum spanning tree algorithm, the input data must be the number of vertices, vertex data and adjacency matrix.
zuixiaoshengchenshu
- 用c语言编写的实现用邻接矩阵存储,最小生成树普里姆算法,最小生成树克鲁斯卡尔算法 -With c languages using adjacency matrix storage, minimum spanning tree Primbetov algorithm, minimum spanning tree algorithm Kruskal