A graph path of minimum total edge weight between its endpoints, among the permitted paths. In an unweighted graph, its weight is the number of edges. A shortest path need not be unique.
Ancestors (6)
Incoming links (21)
- Cycle erasure in minimum-weight walks
- Integer-weight shortest-path tie-breaking lemma
- Line breaking
- Line breaking with squared slack cost
- Minimum-hop dominance for nearly unit weights
- Past exam of the computer science course of the University of Oxford / 2015 / Computer networks / 2 / e / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Intelligent systems / 1 / e / Solution
- Past exam of the computer science course of the University of Oxford / 2023 / Artificial intelligence / 1 / h / Solution
- Past exam of the computer science course of the University of Oxford / 2023 / Artificial intelligence / 1 / i / Solution
- Past exam of the short options course of the University of Oxford / 2017 / 7 / a / ii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2003 / Functional programming, data structures and algorithms, procedural programming, and digital hardware / 5 / c / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2016 / Functional programming, design and analysis of algorithms (resit) / 8 / b / iii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2019 / Functional programming, design and analysis of algorithms / 8 / a / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2023 / Functional programming, design and analysis of algorithms / 5 / a / ii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2023 / Functional programming, design and analysis of algorithms / 5 / b / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2023 / Functional programming, design and analysis of algorithms / 5 / c / Solution
- Positive-weight shortest-path predecessors form a tree
- Shortest-path pursuit distance bound
- Signed edge weights can prevent a shortest-path tree
- Simultaneous rendezvous distance
- Subset DP
Discussion (0) New discussion
There are no discussions about this article yet.
Articles by others on the same topic (0)
There are currently no matching articles.