Content deleted Content added
add connection to successive shortest paths |
m →Connection to successive shortest paths: - link to Johnson's algo page |
||
Line 279:
| website = Algorithms for Competitive Programming
| access-date = May 14, 2023
}}</ref> where the reweighting technique from [[Johnson's_algorithm|Johnson's algorithm]] is used to find the shortest paths.
The implementation from the previous section is rewritten below in such a way as to emphasize this
connection. When the graph is sparse (there are only <math>M</math> allowed job, worker pairs), it is possible
| |||