java实现求解罗马尼亚度假问题，找到从Arad到Bucharest的一条路径。

qq_38249397

已于 2022-04-04 00:48:23 修改

阅读量2.7k

点赞数 1

分类专栏： java 文章标签：罗马尼亚度假 java

于 2018-10-06 18:02:39 首次发布

本文链接：https://blog.youkuaiyun.com/qq_38249397/article/details/82952729

版权

本文通过Java实现迪杰斯特拉算法，详细探讨如何找到从Arad到Bucharest的罗马尼亚地图上的最短路径。算法应用有效，忽略无关内容。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

运用迪杰斯特拉算法（Dijkstra算法），找到Arad到Bucharest的最短路径。注释掉的内容不用管。
图通过邻接表实现，为无向图

import java.util.Scanner;

public class path {
   
static Scanner s=new Scanner(System.in);
	
	
	public static void main(String[] args) {
   
		String[] names={
   "Drobeta","Mehadia","Lugoj","Timisoara","Arad","Zerind","Oradea","Craiova","Rimnicu Vilcea","Sibiu","Pitesti",
				"Bucharest","Fagaras"};
		arc[] arc={
   new arc("Arad","Zerind",75),new arc("Arad","Sibiu",140),new arc("Arad","Timisoara",118),new arc("Timisoara","Lugoj",111),
				new arc("Lugoj","Mehadia",70),new arc("Mehadia","Drobeta",75),new arc("Drobeta","Craiova",120),new arc("Craiova","Pitesti",138),new arc("Craiova","Rimnicu Vilcea",146),
				new arc("Pitesti","Bucharest",101),new arc("Bucharest","Fagaras",211),
				new arc("Rimnicu Vilcea","Pitesti",97),new arc("Rimnicu Vilcea","Sibiu",80),new arc("Sibiu","Fagaras",99),new arc("Sibiu","Oradea",151),new arc("Oradea","Zerind",71)};
		Graph gra = createGraph(names,arc);
		System