I checked solution descriptions and solutions in for the problems in practice 1.
Related resources.
I checked solution descriptions and solutions in for the problems in practice 9
Additional resources:
I checked solution descriptions and solutions in for the problems in practice 8
Additional resources:
I checked solution descriptions and solutions in for the problems in practice 7
Additional resources:
I checked solution descriptions and solutions in for the problems in practice 6.
Additional resources:
I checked solution descriptions and solutions in for the problems in practice 5.
Additional resources include a slide set by Kleinberg/Tardos
I checked solution descriptions and solutions in for the problems in practice 4.
Additional resources
I checked solution descriptions and solutions in for the problems in practice 3.
Additional resources
heapq, Java: PriorityQueue, C++: priority_queue) with O(E log V) or O(m log n).I checked solution descriptions and solutions in for the problems in practice 2.
Additional resources
Note that our handbook code (Java/C++) implements a space-efficient version of union-by-rank with path compression.
I checked solution descriptions and solutions in for the problems in practice 1.