Skip to main content
Side panel
DL 1
Home
Support
User support
GDPR
More
English (en)
Čeština (cs)
Deutsch (de)
English (en)
Français (fr)
Русский (ru)
You are currently using guest access
Log in
DL 1
Home
Support
Collapse
Expand
User support
GDPR
Expand all
Collapse all
Open course index
Faculty of Mathematics and Physics
Department of Applied Mathematics
Algorithms and Datastructures I English
Union-find
Union-find
Section outline
◄
Minimum spanning trees
►
Data-structures for sets
Select activity Recorded lecture
Recorded lecture
URL
Completion
Students must
Mark as done
Select activity Slides (with minor corrections)
Slides (with minor corrections)
File
Completion
Students must
Mark as done
Select activity Slides with hand written notes (from lecture) but without after-class corrections
Slides with hand written notes (from lecture) but without after-class corrections
File
Completion
Students must
Mark as done
Select activity Union-find on wikipedia
Union-find on wikipedia
URL
Completion
Students must
Mark as done
◄
Minimum spanning trees
Jump to...
Main course page
Model of comptuation, time and space complexity
Graph search algorithms (BFS and DFS)
Shortest paths in valued graphs
Minimum spanning trees
Data-structures for sets
Hash tables
Divide and Conquer
Sorting
Dynamic programming
Last homework
►
Data-structures for sets