Search - shortest path graph

Search - shortest path graph - List

[JSP/Java] 50402417 DL : 0: 和树类似，图的遍历是图的一种主要操作，可以通过遍历判别图中任意两个顶点之间是否存在路径、判别给定的图是否是连通图并可求得非连通图的各个连通分量，但对于带权图（网），其最小生成树或最短路径都取决于弧或边上的权值，则需要有特定的算法求解。-and similar trees, graph traversal map is a major operation, Discrimination can traverse map between any two vertices existence trails Discriminant to whether the map graph may seek non - graph the various connectivity components, but with the right plan (net), the minimum spanning tree or shortest path depends on the edge of the arc or the right values, the need for a specific algorithm.
Date : 2008-10-13 Size : 7.9kb User : 李成军
[JSP/Java] 50402417 DL : 0: 和树类似，图的遍历是图的一种主要操作，可以通过遍历判别图中任意两个顶点之间是否存在路径、判别给定的图是否是连通图并可求得非连通图的各个连通分量，但对于带权图（网），其最小生成树或最短路径都取决于弧或边上的权值，则需要有特定的算法求解。-and similar trees, graph traversal map is a major operation, Discrimination can traverse map between any two vertices existence trails Discriminant to whether the map graph may seek non- graph the various connectivity components, but with the right plan (net), the minimum spanning tree or shortest path depends on the edge of the arc or the right values, the need for a specific algorithm.
Date : 2025-12-28 Size : 8kb User : 李成军
[JSP/Java] algorithmsinjavapart5 DL : 0: Java 图算法, 包括最短路径, 有向图算法, 无向图算法, 网络流算法, 等-Java graph algorithm, including the shortest path algorithm for directed graph, undirected graph algorithms, network flow algorithms, such as
Date : 2025-12-28 Size : 4.18mb User : 唐某某
[JSP/Java] bfs-src DL : 0: 1.程序基于java语言。运行要求java运行环境。即就使jdk1.2以上。否则程序无法运行。 2.程序中读图时，可以选择读有向图还是无向图。 3.本程序为一个图的综合运行环境。提供了图的各种操作。包括读图，DFS判断图中是否存在环路，BFS全局访问，两点之间的最短路径，屏幕清空。并且跟踪说明了图的各种操作的过程。 4.程序可以多次的读图，进行图的各种操作。点击面板上的各种按钮就可以进行各种操作。-1. Procedures based on the java language. Java runtime environment operational requirements. That makes more than jdk1.2. Otherwise, the procedure can not run. 2.读图process, you can choose to read or a directed graph undirected graph. 3. This procedure is a map of the integrated operating environment. Provides a map of the various operations. Including读图, DFS diagram to determine the existence of loops, BFS overall visit to the shortest path between two points, the screen cleared. And tracking map shows the course of the various operations. 4.读图can be repeated for a variety of operating plans. Click on the various buttons on the panel can conduct various kinds of operation.
Date : 2025-12-28 Size : 6kb User : lyxh
[JSP/Java] Noname1 DL : 0: 用无向网表示你所在学校的校园景点平面图，图中定点表示主要景点，存放景点的编号、名称、简介等信息。要求能够回答有关景点介绍、游览路经等问题。要求：(1)查询各景点相关信息； (2)查询图中任意两个景点的最短路径。 (3)查询图中任意两个景点的所有路径。 --Free to the net means that the school campus attractions in your plans, the figure fixed-point of their main attractions, storage spots number, name, profile and other information. Requires the ability to answer questions about attractions introduction, tour passing by and so on. Requirements: (1) check the relevant information sites (2) query graph the shortest path between any two spots. (3) The query graph for all paths of any two spots.
Date : 2025-12-28 Size : 4kb User : yangyong
[JSP/Java] topologyWeight DL : 0: 实现计算图的最短路径算法，同时计算每个节点和链路的权值。-To achieve the shortest path algorithm for computing graph, while calculated for each node and link weights.
Date : 2025-12-28 Size : 100kb User : mahongmei
[JSP/Java] Dijkstra_java DL : 0: 使用Java实现应用迪杰斯特拉算法进行有向带权图中的最短路径的查找。-it is got the shortest path of graph with Dijkstra by java.
Date : 2025-12-28 Size : 2kb User : 孔凤玉
[JSP/Java] Dijkstra DL : 0: Dijkstra s algorithm!!! How you can find the shortest path in a graph
Date : 2025-12-28 Size : 1kb User : fanmoy
[JSP/Java] shortpath DL : 0: 有向图单源最短路径，由随机函数产生边权，源顶点可以自己指定。-A single-source shortest path to the graph, the right side by a random function generator, source vertex can specify your own.
Date : 2025-12-28 Size : 208kb User : xing
[JSP/Java] algo DL : 0: This is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree. This algorithm is often used in routing and as a subroutine in other graph algorithms. NetBeans project
Date : 2025-12-28 Size : 26kb User : Nastya
[JSP/Java] GrafoGrafic DL : 0: Dijkstra s algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956 and published in 1959,[1][2] is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree. This algorithm is often used in routing and as a subroutine in other graph algorithms.
Date : 2025-12-28 Size : 40kb User : ivan
[JSP/Java] DrawImg DL : 0: 这个是很好的图形最小生成树的实现，他说明了很多最小生成树的问题，最短路问题都解决了-This is a good realization of minimum spanning tree graph, he shows a lot of the minimum spanning tree problem, shortest path problems are solved
Date : 2025-12-28 Size : 8kb User : yangai
[JSP/Java] ShortestParth DL : 0: 计算无向图中的最短路径。elcipse通过测试。-Calculating an undirected graph of the shortest path. elcipse pass the test.
Date : 2025-12-28 Size : 1kb User : 思维奔逸
[JSP/Java] dijkstra DL : 0: java实现有向图中寻找最短路的dijkstra算法，具有通用性，这是图论中一个十分重要的算法-java achieve a directed graph dijkstra algorithm to find the shortest path, with the versatility, this is a very important graph theory algorithms
Date : 2025-12-28 Size : 85kb User : 于献智
[JSP/Java] Graph DL : 0: Graph measuring the Shortest Distance to vertex, class file for the The Path.java program.
Date : 2025-12-28 Size : 2kb User : bibs
[JSP/Java] Dijkstra DL : 0: 迪杰斯特拉算法是由荷兰计算机科学家狄克斯特拉于1959 年提出的，因此又叫狄克斯特拉算法。是从一个顶点到其余各顶点的最短路径算法，解决的是有向图中最短路径问题。迪杰斯特拉算法主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。-Dijkstra algorithm was proposed by the Holland computer scientist Dijkstra in 1959, and therefore also called Dijkstra algorithm. Is the shortest path algorithm a vertex to the rest of the vertices of the shortest path algorithm to solve the shortest path problem in the graph.
Date : 2025-12-28 Size : 7kb User : 邹威