Share Description
In this course, you will learn:
- Exploration of graphs and their deconstruction into connected components.
- Algorithms for finding the shortest pathways, such as breadth-first search, Dijkstra's algorithm, and Bellman-Ford algorithm.
- Algorithms based on minimum spanning trees.
Syllabus:
- Decomposition of Graphs
- Shortest Paths
- Minimum Spanning Trees
- Flows in Networks
