搜索资源列表
primkruskal
- 用克鲁斯卡尔（kruskal)算法求N个结点所联成的加权无向图的最小生成树，核心代码比较简单。-Using Kruskal (kruskal) algorithm to solve the N nodes are linked to form a weighted undirected graph of the minimum spanning tree, the core code simple.
rrrrrrr
- 以邻接多重表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-To the adjacent multi-table storage structure, connectivity undirected graph depth first and breadth-first traversal. User-specified node as a starting point, respectively, under
tubianliyanshi
- 以邻接多重表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-To the adjacent multi-table storage structure, connectivity undirected graph depth first and breadth-first traversal. User-specified node as a starting point, respectively, under
Graph
- 无向图 无向网 有向图 有向网的邻接矩阵的实现-Undirected graph directed graph undirected network with the network implementation of the adjacency matrix
Kruskal
- Kruskal算法 求解无向图的最小生成树-Kruskal algorithm for minimum spanning tree of an undirected graph
createtu
- 用邻接矩阵创建图并将其输出：本程序可以有四种图形式：分别为有向图，无向图，有向网，无向网；-Create a map with the adjacency matrix and the output: This program can graph four forms: namely a directed graph, undirected graph, the network, not to the network
prim
- 建立无向图，初始化矩阵，输出无向图的邻接矩阵-The establishment of an undirected graph, initialize the matrix, the output adjacency matrix of undirected graph
ass4
- 数据结构作业4：以数偶的形式依次从键盘上输入一串数据。如：(A，B)为从起始结点（其数据场之值为一大写的英文字母 A ），到终止结点（其数据场之值为一大写的英文字母 B）的无向边。最后输入（Z，Z）表示输入结束。请用无向图的邻接多重表存储该无向图，并注意一定要使用动态存储结构。-Data Structure Assignment 4: The order of a few even in the form of a string of data input from the keyboard.
graph
- 无向图的建立以及深度优先和广度优先遍历并输出 -DFS and BFS search for a graph
min_tree
- 从conf.txt文件读取无向图矩阵 PRIM算法分步实现最小生成树-File read from conf.txt PRIM algorithm for undirected graph matrix step by step to achieve the minimum spanning tree
DFTravel
- 代码可以实现有向图及无向图的深度优先收缩-Code can achieve a directed graph and undirected graph depth-first contraction
calculationofstrongly
- 无向图的强连通计算 高效率算法 图论算法-No calculation of strongly connected directed graph
2(2)
- 最小生成树之Prim算法 Prim算法用于求无向图的最小生成树 设图G =（V，E），其生成树的顶点集合为U。 ①、把v0放入U。 ②、在所有u∈U，v∈V-U的边(u，v)∈E中找一条最小权值的边，加入生成树。 ③、把②找到的边的v加入U集合。如果U集合已有n个元素，则结束，否则继续执行②。 其算法的时间复杂度为O(n^2) Prim算法实现： （1）集合：设置一个数组set(i=0,1,..,n-1),初始值为 0,代表对
YEN
- 在无向图中，用YEN算法实现前求K短无环路径。-YEN
tt0703
- 搜索算法。无向图的邻接表存储，深度优先搜索-Undirected graph of adjacency table storage, depth-first search
daohang
- 用c语言实现的校园导航，包含多个顶点的无向图。具体功能有，最短路径，最佳路径（汉米尔顿回路）。-With c language campus navigation, multiple vertices undirected graph. Specific function, shortest path, the best path (Hamilton circuit).
campus_tour_program
- 问题描述：用无向图表示你所在学校的校园景点平面图，图中顶点表示主要景点，存放景点的编号、名称、简介等。 设计要求： 1．查询各景点的相关信息； 2．查询图中任意两个景点间的最短路径； 3．查询图中任意两个景点间的所有路径。 -Problem Descr iption: The undirected graph that spot in your school campus plan, said the main attractions of vertices, the num
Graphtraversal
- 输入给定的有向图或无向图实现深度优先遍历和广度优先遍历-Graph Traversal
Prim
- 最小生成树的Prim算法的实现。这里是对无向图最小生成树的实现。-Prim minimum spanning tree algorithm. There is no realization of the minimum spanning tree graph.
nixushuzuiduanlujing
- 该文件夹中包括几个acm比赛中用到的模板 求逆序数，无向图的bfs收索，有向图中的两点间的最短距离。希望对大家有用。-The folder includes several templates used in the game acm find reverse numbers, income bfs undirected graph cable, directed graph in the shortest distance between two points. Hope that use