最短路径–城市路径问题:
问题描述:求从1号城市到5号城市的最短路径长度
Input:
5 8
1 2 2
1 5 10
2 3 3
2 5 7
3 1 4
3 4 4
4 5 5
5 3 3
Output:
9
DFS
import java.util.Scanner;
public class minPath {
static int min = 99999999;
static int[][] e = new int[100][100];
static int[] book = new int[100];
static int n, m;
static Scanner input = new Scanner(System.in);
public static void main(String[] args) {
n = input.nextInt();
m = input.nextInt();
for (int i = 1; i <= n; i++) {
for (