搜索资源列表
求解路径.rar
- 求解有向图的路径
BFSandDFS
- 用C写的源程序功能分别是1.用DFS算法判断有向图中是否有环2.从文件中读图，用邻接链表保存信息，寻找两个结点vi,vj间的最短路径-written in C source is a function respectively. DFS algorithm used to determine whether there are plans Central 2. Interpret drawings from the file, use
5班8号周前平
- 输入一个有向图，用深度优先搜索，判断该图是否为一有圈的图。-importation of a directed graph, with the depth-first search to determine whether the plan is a map of the circle.
GetDegree
- 通过输入来控制是建立有向图还是无向图，输入节点数，边数，来计算每个节点的出度和如度-adopted to control importation is to establish a map or no map to the input nodes, edges, to calculate each node degrees out and if degrees
GraphCC
- 有向图的强连通分量算法的java语言实现，-directed graph algorithms strongly connected component of java language.
tppx
- 拓扑排序，以前做的，可以实现6个顶点8条弧的任意有向图的拓扑排序-topological sorting, previously done, can achieve a six point eight arbitrary arc to a map of topological sorting
030300305euler.cpp
- 有时仅对赋权有向图上从任意一个顶点到另外任意一个顶点之间有没有路感兴趣。试修改Floyd算法，计算出图的道路矩阵P，使得从顶点i到顶点j有路时P[i,j]= 1,否则P[i,j]= 0。-sometimes only to empower a map from any one vertex to another arbitrary point between a road not interested. Try to amend Flo
graphicsalgorithmy
- 一套很好的图论算法源码,包括图的遍历,最短路径的实现，有向图计算、拓扑排序等多个算法的源码。-a good graph algorithm source code, including the traverse map, the shortest path, and it is to map, many other topological sorting algorithm source code.
graphsc
- 有向图的强连通分支查找，使用java实现，代码经过调试，绝对高效率，正确和可靠-a map to digraphs to find, use java achieved through debugging code, the absolute high efficiency, the correct and reliable
topu
- 输入有向图的顶点，又有优先级的要求，通过此程序可以得到一个合理的排序-importation plan to the apex, another priority of the request, through this procedure can be a reasonable sort of
BoxDual
- 是一个有自动求解功能的推箱子游戏，本人的旧作品。使用了从起点和终点两个方向同时进行有向图搜索的方法，是学习博弈算法的极佳参考。闲来玩玩这个游戏可锻炼思维，精选了网上流行的很多高难度地图，如果全部都可不使用AI求解，那就很厉害了。-is an automatic function of viewing solving games, my old works. Use the starting and finishing points fr
up3
- 本程序为“有向图的遍历及运算”，非常方便使用，希望大家能够喜欢。-the procedures as "directed graph traversal and calculations," is very convenient to use and I hope we can like.
CrossPointNo
- CrossPointNo=53 ％％％输入图中节点的总数目 对已知的边进行赋值，注意：有向图的Cost(i,j)=Cost(j,i)-CrossPointNo = 53%%% imported map nodes to the total number of known side Fu value, attention : to map Cost (i, j) = Cost (j, i)
excellentwaysofshortpath
- 程序的主要功能是实现有向图最短路径的搜索，采用的数据是txt格式的邻接矩阵，采用的算法为改进的狄氏算法。内附调试和文件说明。-procedures main function is to achieve the shortest path to the map search, The data format is txt adjacent matrix, the algorithm to improve the dieldrin alg
youxiangtulianshijiegoulinjiebiao
- 有向图链式结构邻接表表示法，可以作为头文件使用，方便那些初学数据结构的同学！-directed graph chain structure adjoining table, can be used as the first document, facilitating data structure novice students!
ImproveShortestPathArithmetic
- 应用斐波纳契堆和邻接表改进单源最短路径算法，使其算法的时间复杂性由O( )减少为O（nlogn+e）,其中e为有向图的边的条数。-application Fibonacci heap and the adjacent table to improve single source shortest path algorithm, its algorithm's time complexity of O () reduced to
sy10(1)
- 图的存储结构与遍历 （1）画出如图（1）所示无向图的邻接矩阵和邻接表，列出该图的广度优先遍历和深度优先遍历结果（选定A为出发点进行遍历）。 （2）画出如图（2）所示有向图的邻接矩阵和邻接表，列出该图的广度优先遍历和深度优先遍历结果（选定A为出发点进行遍历）(The storage structure of the graph and traversal (1) draw the adjacency matrix
dijkstra
- 求有向图中的一点到任意一点之间的最短路径，用dijkstra算法实现。(The shortest path between one point and any point in the directed graph is realized by the Dijkstra algorithm.)
fyneoa4
- 该问题为单元最短路经问题,求出一个有向图中两点之间权值最小的路径, Dijkstra算法要求有向图中没有权值为负的边()
图论
- 资源说明：图论的基本应用,包括寻找有向图的基，独立割集的连通图，最大联通子图等几乎所有图论的基本程序-The basic application of graph theory, including the search for a directed graph of the base, connected graph cut sets separate maximum Unicom subgraph of graph theory,