Description: 图的算法实现
（1）将图的信息建立文件；
（2）从文件读入图的信息，建立邻接矩阵和邻接表；
（3）实现Prim、Kruskal、Dijkstra和拓扑排序算法。
-Graph Algorithms (1) will map the information to create the document (2) read from the document map information, the establishment of adjacency matrix and adjacency list (3) the realization of Prim, Kruskal, Dijkstra, and topological sorting algorithm. Platform: |
Size: 105472 |
Author:陈阳 |
Hits:
Description: 图的算法实现
（1）将图的信息建立文件；
（2）从文件读入图的信息，建立邻接矩阵和邻接表；
（3）实现Prim、Kruskal、Dijkstra和拓扑排序算法。
-Graph Algorithms (1) will map the information to create the document (2) read from the document map information, the establishment of adjacency matrix and adjacency list (3) the realization of Prim, Kruskal, Dijkstra, and topological sorting algorithm. Platform: |
Size: 28672 |
Author:陈阳 |
Hits:
Description: 各种算法的flash演示（一共45个：B树的删除、生长过程，单链表结点的插入、删除，二叉排序树的生成、删除，构造哈夫曼树的算法模拟、克鲁斯卡尔算法构造最小生成树、邻接表表示的图的广度优先遍历、寻找中序线索化二叉树指定结点的后继......）-The flash demo of various algorithms (a total of 45: B tree removal, growth process, a single linked list node insert, delete, binary sort tree generation, deletion, Huffman tree construction algorithm simulation, Kruskal construct minimum spanning tree algorithm, adjacency list that breadth-first traversal of the graph to find clues to the sequence of binary tree nodes designated successor ......) Platform: |
Size: 964608 |
Author: |
Hits:
Description: 这个源代码包含了图的邻接矩阵和链表的两种存储方式、深度和广度的遍历以及prim
和kruskal最短路径两种算法。-The source code contains the adjacency matrix and list two storage mode, the breadth and depth of the traversal and prim
And kruskal shortest path of two algorithms. Platform: |
Size: 2048 |
Author:cyy |
Hits:
Description: 1.掌握图的基本存储方法：邻接矩阵和邻接表（本程序中使用邻接矩阵）；
2.掌握有关图的基本操作算法并能使用高级语言实现（本程序使用C语言）；
3.掌握图的深度优先搜索遍历和广度优先搜索遍历算法；
4.掌握图的最小生成树的两种算法：prim算法和kruskal算法。
5.掌握图的最短路径的两种算法：DIJ算法和floyd算法。
-1 The basic storage methods mastered graph: adjacency matrix and adjacency list (the adjacency matrix used in the program)
2 master basic operations related to graph algorithms and high-level language can be used to achieve (the program uses C language)
3 master depth-first search and breadth-first traversal traversal search algorithm
4 master plans of the two minimum spanning tree algorithm:. Prim algorithm and kruskal algorithm.
5 master shortest path of two algorithms:. DIJ algorithm and floyd algorithm. Platform: |
Size: 4096 |
Author:奋斗菠萝 |
Hits:
Description: 基于Virtual C++的数据结构中图的应用，能实现从文件输入有向图和无向图易邻接表和邻接矩阵的形式在屏幕输出，同时能实现无向图的深度遍历输出和广度遍历输出；kruskal算法和Prim算法实现最小生成树的创建；Dijkstra算法实现最短路径的计算；以及最小偏心距的计算。-Application of data structure of Virtual in C++ based on graph, can be achieved the file input directed graphs and undirected graph adjacency list and the adjacency matrix is easy to form on the screen output, at the same time, can realize the undirected graph depth first traversal and breadth traversal output output Kruskal algorithm and Prim algorithm to achieve the creation of the Oki Nariki Dijkstra algorithm the shortest path calculation and the calculation of minimum eccentricity. Platform: |
Size: 1080320 |
Author:易新宇 |
Hits:
Description: Kruskal最小生成树算法一、 实验目的
1、 掌握图的邻接表结构
2、 掌握最小生成树算法
二、 实验内容
基于邻接表实现kruskal算法(Kruskal minimum spanning tree algorithm, the purpose of the experiment
1. Master the adjacency list structure of the graph
2, master the minimum spanning tree algorithm
Two, experimental content
Implementation of Kruskal algorithm based on adjacency list) Platform: |
Size: 59392 |
Author:结节
|
Hits:
Search - kruskal adjacency list