Revision as of 21:08, 18 March 2025 edit Jerzy.Respondek (talk \| contribs) 78 edits mNo edit summary Tag: Reverted ← Previous edit		Revision as of 21:28, 18 March 2025 edit undo MrOllie (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 255,824 edits Reverted 1 edit by Jerzy.Respondek (talk): Rv citespam Tags: Twinkle Undo Next edit →
Line 29: * [[Viterbi algorithm]] solves the shortest stochastic path problem with an additional probabilistic weight on each node. Additional algorithms and associated evaluations may be found in {{harvtxt\|Cherkassky\|Goldberg\|Radzik\|1996}}. Also fast matrix multiplication algorithms can be used <ref>{{cite book\|title=Fast Matrix Multiplication with Applications, Ch. 9 \| last = Respondek \| first = J.S. \| publisher=Springer Cham\| series=Studies in Big Data \|volume=166\| date=2025 \|isbn=978-3-031-76929-0 \|url=https://link.springer.com/chapter/10.1007/978-3-031-76930-6_9}}</ref>. ==Single-source shortest paths==

Shortest path problem: Difference between revisions