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
Graph search algorithms (BFS and DFS)
Graph search algorithms (BFS and DFS)
Section outline
◄
Model of comptuation, time and space complexity
►
Shortest paths in valued graphs
Select activity Problem sheet (DFS and BFS)
Problem sheet (DFS and BFS)
URL
Completion
Students must
Mark as done
Select activity Post questions/discussion/pointers to good study materials here
Post questions/discussion/pointers to good study materials here
Forum
Completion
Students must
Mark as done
Select activity Problem sheet (DFS applications)
Problem sheet (DFS applications)
URL
Completion
Students must
Mark as done
Select activity Problem sheet (DFS applications 2 and homework)
Problem sheet (DFS applications 2 and homework)
URL
Completion
Students must
Mark as done
Select activity Finding bridges in a graph
Finding bridges in a graph
URL
Completion
Students must
Mark as done
Select activity Solutions to the previous problem sheet
Solutions to the previous problem sheet
URL
Completion
Students must
Mark as done
◄
Model of comptuation, time and space complexity
Jump to...
Main course page
Model of comptuation, time and space complexity
Shortest paths in valued graphs
Minimum spanning trees
Union-find
Data-structures for sets
Hash tables
Divide and Conquer
Sorting
Dynamic programming
Last homework
►
Shortest paths in valued graphs