Practice 6
· One min read
I checked solution descriptions and solutions in for the problems in practice 6.
Additional resources:
26 posts tagged with "practice"
View All TagsPractice 5
· One min read
I checked solution descriptions and solutions in for the problems in practice 5.
Additional resources include a slide set by Kleinberg/Tardos
Practice 4
· One min read
I checked solution descriptions and solutions in for the problems in practice 4.
Additional resources
Practice 3
· One min read
I checked solution descriptions and solutions in for the problems in practice 3.
Additional resources
- Sedgwick's Lecture Slides on Dijkstra. See slide 37 for a more precise complexity analysis
than I gave in class. We're generally using the "lazy" binary heap variant (Python:
heapq, Java:PriorityQueue, C++:priority_queue) with O(E log V) or O(m log n).
Practice 2
· One min read
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.
Practice 1
· One min read
I checked solution descriptions and solutions in for the problems in practice 1.