Explore - LeetCode
leetcode.com/explore/learn/card/graph/622/single-source-shortest-path-algorithm/3864/
1 Users
0 Comments
1 Highlights
0 Notes
Tags
Top Highlights
In a “graph with no negative-weight cycles” with N vertices, the shortest path between any two vertices has at most N-1 edges.
Ready to highlight and find good content?
Glasp is a social web highlighter that people can highlight and organize quotes and thoughts from the web, and access other like-minded people’s learning.