Dijkstra's Algorithm: Difference between revisions
From Rice Wiki
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
[[Category:Algorithms]] | [[Category:Algorithms]] | ||
<aside class="portable-infobox noexcerpt pi-background pi-theme-default pi-layout-stacked"> | |||
== Dijkstra's Algorithm == | |||
</aside><span></span> | |||
<span></span> | |||
Problem: [[Shortest Path Problem]]. | Problem: [[Shortest Path Problem]]. | ||
| Line 7: | Line 11: | ||
= Approach = | = Approach = | ||
{{Infobox Algorithm|class=[[Graph Algorithms]]}} | |||
= Implementation = | = Implementation = | ||
Revision as of 00:44, 6 March 2024
<aside class="portable-infobox noexcerpt pi-background pi-theme-default pi-layout-stacked">
Dijkstra's Algorithm
</aside>
Problem: Shortest Path Problem.
The weight of edges must be positive.
