问从s到t最多k+1条边的最小值,不存在返回-1
图论题,不会做,感觉比较难理解,应该算是dijkstra算法的应用
讲解dijkstra算法:
https://www.luogu.com.cn/blog/ztyluogucpp/qian-tan-dijkstra
我来解释一下高票里的解法
维护一个优先队列,节点内容是到达某个节点用了stop条边的最小值,优先队列按照边权升序排列。
初始化的时候加入一个起点,每次从有限队列取出一个,然后枚举从这个点开始的所有出边,维护后加入到优先队列,感觉有点说不清楚,具体看代码吧
public int findCheapestPrice(int n, int[][] flights, int src, int dst, int K) {
//建图
List<List<Edge>> graph = new ArrayList<>();
for (int i = 0; i < n; i++) graph.add(new ArrayList<>());
for (int[] a : flights) graph.get(a[0]).add(new Edge(a[2], a[1]));
//优先队列初始化, 按照边权从小到大排序
PriorityQueue<Node> pq = new PriorityQueue<>(Comparator.comparingInt(o -> o.dis));
//最多k+1条边
pq.add(new Node(src, 0, K + 1));
while (!pq.isEmpty()) {
Node poll = pq.poll();
int dis = poll.dis;
int point = poll.startPoint;
int stop = poll.stop;
//优先队列里维护着到达point的最小值
if (point == dst) return dis;
if (stop == 0) continue;
//枚举从point所有的出边
List<Edge> edges = graph.get(point);
for (Edge edge : edges) {
pq.add(new Node(edge.endPoint, dis + edge.dis, stop - 1));
}
}
return -1;
}
class Edge {
int dis;
int endPoint;
public Edge(int dis, int endPoint) {
this.dis = dis;
this.endPoint = endPoint;
}
}
class Node {
int startPoint;
int dis;
int stop;
public Node(int startPoint, int dis, int stop) {
this.startPoint = startPoint;
this.dis = dis;
this.stop = stop;
}
}