Revision as of 01:07, 28 September 2006 edit Gwern (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers, Rollbackers 48,508 edits m Robot-assisted disambiguation (you can help!): Edge ← Previous edit		Revision as of 14:55, 7 December 2006 edit undo Josteinaj (talk \| contribs) 71 edits No edit summary Next edit →
Line 1: {{Tree search algorithm}} '''Johnson's algorithm''' is a way to solve the [[all-pairs shortest path problem]] in a [[sparse matrix\|sparse]], [[weighted graph\|weighted]], [[directed graph]].

Johnson's algorithm: Difference between revisions