通过顶点W¯¯找到最短路径顶点u到v的传球？ [英] Find shortest path from Vertex u to v passing through a vertex w?

问题描述

在一个有向图具有非负边权，我可以很容易地找到于V使用Dijkstra的从u最短路径。但是，有没有简单的调整，以Dijkstra的，这样我可以通过给定的顶点W¯¯找到最短路径u到v。还是有其他的算法建议？

In a directed graph with non-negative edge weights I can easily find shortest path from u to v using dijkstra's. But is there any simple tweak to Dijkstra's so that I can find shortest path from u to v through a given vertex w. Or any other algorithm suggestions?

推荐答案

从u找到最短路径W，然后从ω到v的最短路径。

Find the shortest path from u to w, then the shortest path from w to v.

这篇关于通过顶点W¯¯找到最短路径顶点u到v的传球？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！