检查边长度限制的路径是否存在 II

/*
题目思路:
可以使用Dijkstra算法来寻找最短路径，同时维护一条边的最大长度限制。使用Stream API来处理数据。
*/

import java.util.*;
import java.util.stream.Collectors;

public class Solution {
    class Edge {
        int to, length;
        Edge(int to, int length) {
            this.to = to;
            this.length = length;
        }
    }
    
    public boolean pathWithLengthLimit(int n, int[][] edges, int limit, int start, int end) {
        List<List<Edge>> graph = new ArrayList<>(Collections.nCopies(n, null)).stream().map(e -> new ArrayList<Edge>()).collect(Collectors.toList());
        Arrays.stream(edges).forEach(edge -> {
            graph.get(edge[0]).add(new Edge(edge[1], edge[2]));
            graph.get(edge[1]).add(new Edge(edge[0], edge[2]));
        });
        
        PriorityQueue<int[]> pq = new PriorityQueue<>(Comparator.comparingInt(a -> a[1]));
        pq.offer(new int[]{start, 0});
        int[] dist = new int[n];
        Arrays.fill(dist, Integer.MAX_VALUE);
        dist[start] = 0;
        
        while (!pq.isEmpty()) {
            int[] current = pq.poll();
            int currentNode = current[0];
            int currentLength = current[1];
            if (currentNode == end) {
                return currentLength <= limit;
            }
            graph.get(currentNode).forEach(edge -> {
                int newLength = currentLength + edge.length;
                if (newLength < dist[edge.to]) {
                    dist[edge.to] = newLength;
                    pq.offer(new int[]{edge.to, newLength});
                }
            });
        }
        return false;
    }
}