New answers tagged weighted-graphs
2
votes
Accepted
Other vertices on the shortest path between two specific vertices
Here are some ideas I think could work.
When applying Dijkstra's algorithm and after extracting a vertex $u$ from the priority queue, for each neighbour $v$ of $u$, it is usual to check if:
$$d(a, u) +...
- 17k
Top 50 recent answers are included