搜索资源列表
7nodenet
- 生成一个小的网络,包含了图的连通性,只有7个节点
min_spintree
- 在给定的任意一个无向图中,利用反圈算法找出最小支撑树,得到一个图的连通性判断
ck_conty
- ck_conty为判断图的连通性的matlab mex文件,另附带包含BFS和DFS的C源程序
7nodenet
- 生成一个小的网络,包含了图的连通性,只有7个节点-Generate a small network, includes a map of connectivity, only seven nodes
min_spintree
- 在给定的任意一个无向图中,利用反圈算法找出最小支撑树,得到一个图的连通性判断-Given an arbitrary undirected graph, the use of anti-loop algorithm to find minimum spanning tree, get a map to determine connectivity
ck_conty
- ck_conty为判断图的连通性的matlab mex文件,另附带包含BFS和DFS的C源程序-ck_conty for judging connectivity map matlab mex file, and the other side contains the BFS and DFS
TraversingGraph
- 图的遍历算法是求解图的连通性问题、拓扑排序和求关键路径等算法的基础-Graph traversal algorithm is to solve the graph connectivity problem, topological sorting and demand, such as critical path algorithm
test
- 判断图的连通性。单连通,强联通和弱联通 -To determine connectivity map
tulun
- 通过鼠标点击界面,绘制一个图结构,用图论中的知识判断图的连通性,判断他是不是一棵树,另外还可以显示它的邻接矩阵、可达性矩阵等。-By mouse click interface, draw a graph structure, using graph theory knowledge to assess the graphs to determine that he is not a tree, it also can display
aaa
- 对任意给定的图(顶点数不小于20,边数不少于30,图的类型可以是有向图、无向图、有向网、无向网),能够输入图的顶点和边(或弧)的信息,并存储到相应存储结构(邻接矩阵、邻接表、十字链表、邻接多重表,任选其中两种类型),对自己所创建的图完成以下操作: 对无向图求每个顶点的度,或对有向图求每个顶点的入度和出度(5分) 完成插入顶点和边(或弧)的功能(5分) 完成删除顶点和边(或弧)的功能(5分) 两种存储结构的转换(5分),
graohliantong
- 利用深度优先遍历,判断无向/有向图的连通性的程序。-Using depth-first traversal to determine undirected/directed graph of the connectivity process.
Graphalgorithm
- 图论算法实现,含树,欧拉圈,霍夫曼编码,图的连通性,着色树,最短路径等,且采用加载皮肤界面,界面美观-Graph algorithms, including trees, Euler circles, Huffman coding, graph connectivity, coloring trees, shortest paths, and the interface with loads of skin, beautiful int
CHAP07
- 图的定义存储结构,图的遍历和图的连通性问题-The definition of storage structure diagram, graph traversal and graph connectivity problems
concom_
- 图论算法matlab实现,图的连通性计算算法-Graph theory algorithm matlab implementation, the connectivity map computation algorithm
graph-algorithm
- 图论算法,包括最短路算法、最小生成树、图的连通性、网络流、匈牙利算法等等源码-graph algorithm
Graph-theory-and-applications
- 图论及应用 了解图的基本概念如树、图的连通性、Euler图、Hamilton图,以及图的匹配与因子分解,还有平面图和图的着色,有向图,图、群与矩阵-Graph theory and applications、 Euler Graph、 Hamilton Graph、Connectivity of Graph
Breadth-first-search-algorithm
- 广度优先搜索算法判断图的连通性Breadth first search algorithm of judgment figure connectivity -Breadth first search algorithm of judgment figure connectivity
warshall
- warshall算法,解决了图的连通性问题,输入一个矩阵,输出的两个矩阵,一个表示连通性的判断,另一个表示连通分支的表示。-Warshall method, which solves the problem of the graph connectivity, while entering a matrix, there will output two matrix, one said connectivity judgment, th
liantong_numofblocks
- 根据图的邻接矩阵判断图的连通性并计算图的分块数(To determine the connectivity of the graph and computing graph blocks according to the adjacency matrix)
Qt_Flight
- 图形化界面,简易航线查询系统,数据源为压缩包内的.csv文件 求任意两个机场之间的最短飞行时间。 仅限直飞或 1 次中转,求任意两个机场的航线(航班 ID 顺序表)。 给定起飞时段或者降落时段或者机型要求,求任意两个机场的多个备选航线(航班 ID 顺序表)。 给定起飞时段或者降落时段或者机型要求,求任意两个机场之间的航费(机票价格)最低的路径。(Find the shortest flight time between a