Search - shortest path graph

Search - shortest path graph - List

[Software Engineering] dao-you-xi-tong DL : 0: 设计连云港市导游系统。以图中顶点表示各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等相关信息。为来访客人提供图中任意景点相关信息的查询。为来访客人提供图中任意景点的问路查询，即查询任意两个景点之间的一条最短的简单路径。提供图中任意景点查询，即求任意两点间的所有路径。导游图的景点和道路的修改扩充功能。 -Lianyungang City guide system design. To vertices that the attractions, storage sites name, code, profile and other information the side that path, the path length of storage and other related information. The figure for visiting any sites offering information related to queries. Offers a map for visiting attractions, ask any query, that query between any two spots of a shortest simple path. Any spots available in the query graph, ie find all paths between any two points. Road map guide attractions and changes to extensions.
Date : 2025-12-28 Size : 4kb User : 刘
[Software Engineering] graph-theory-and-program-designe DL : 0: 详细的介绍了图论的各种概念如：分叉树，最短路径，遍历等以及相应的程序设计-A detailed description of the various concepts of graph theory such as: the bifurcation tree, shortest path, traverse, and the corresponding program design
Date : 2025-12-28 Size : 5.03mb User : sun cong
[Software Engineering] floyd DL : 0: 此源码是算法floyd算法的实现,里面有我自己详细解说的几个重点，对于学习图论很有帮助，用于求任意两点间最短路径和路径长度-This source is the realization of the algorithm floyd algorithm, which has my own detailed explanation of several key helpful for learning graph theory, used to find the shortest path between any two points and the path length
Date : 2025-12-28 Size : 1kb User : 韦龙
[Software Engineering] short_path DL : 0: 在現有的權重圖當中,找尋最短的路徑到達目的地,可應用在許多工程方面的問題-Given a weighted graph, Find all-pairs shortest path solution.
Date : 2025-12-28 Size : 1.38mb User : hubert
[Software Engineering] 5 DL : 0: 已知一个有向带权图G和图中某个源点V0，求得从该源点V0到图中其它各个顶点之间的最短路径。-Given a directed weighted graph G and a source figure V0, V0 obtained from the source to the other drawing the shortest path between the vertices.
Date : 2025-12-28 Size : 248kb User : miyor
[Software Engineering] tulunzuiduanlumatlabcode DL : 0: 解决图论中最短路问题的最好方法--“Dijstra算法,”通过解析实例模型,对模型算法进行描述、拓展,并给出了求最短路以及求最短路长的MATLAB程序,此程序具有通用性。-The best way to solve the shortest path problem in graph theory is- "Dijstra algorithm," by parsing instance model, the model describes the algorithm, expand, and gives the shortest and seek seek the shortest length of the MATLAB program, this program has versatility.
Date : 2025-12-28 Size : 218kb User : 王斌
[Software Engineering] zui-duan-lu-jing- DL : 0: 图论中最短路问题的MATLAB 程序实现-The shortest path problem in graph theory MATLAB program to achieve
Date : 2025-12-28 Size : 219kb User : chenkai
[Software Engineering] Test DL : 0: 最短路中的广度优先搜索，Dijkstra算法。网络算路问题的更优算法实现对于网络资源高效配置具有重要价值。题目是：给定一个带权重的有向图 G (V,E)，V 为顶点集，E 为有向边集，每一条有向边均有一个权重。对于给定的顶点 s、t，以及 V 的子集 V ，寻找从 s 到 t 的不成环有向路径 P，使得 P 经过 V 中所有的顶点(对经过 V 中节点的顺序不做要求)。若不存在这样的有向路径 P，则输出无解，程序运行时间越短，则视为结果越优；若存在这样的有向路径 P，则输出所得到的路径，路径的权重越小，则视为结果越优，在输出路径权重一样的前提下，程序运行时间越短，则视为结果越优。-Shortest in the BFS, Dijkstra algorithm. Better network algorithm calculates a path for network problems to achieve efficient allocation of resources of great value. Title is: Given a weighted directed graph G (V, E), V is the set of vertices, E is set to have the edge, each side has to have a weight. For a given vertex s, t, and V subset V , looking s to t acyclic directed path P, such that P through V in all vertices (elapsed V nodes in order not to Claim). If there is a directed path P, the output is no solution, the shorter the time the program runs, the more the result is considered excellent if there is a directed path P, the resulting output path, the path of the right weight is smaller, it is considered more excellent results in the output path weight the same premise, the shorter the time the program runs, the more the result is considered excellent.
Date : 2025-12-28 Size : 21kb User : wangwanwan