Graph Algorithms Course. This course will help you learn one of the most complex data structures, namely graphs, in the simplest way possible. Graphs are one of the most fascinating topics in computer science due to their wide range of applications in the real world. From Google Maps navigation to website ranking algorithms and social network design, traces of graphs can be seen everywhere. In this course, you will be introduced to the basic concepts of graphs, types of graph traversal (BFS and DFS), disconnected sets, spanning trees, shortest paths, network flow and more advanced topics. Also, with the help of a practical project provided at the end of the course, you can test your knowledge in the field of graphs. This project is designed based on concepts such as graph visualization, dynamic programming on graphs and Dijkstra’s algorithm.
What you will learn:
- Basic concepts of graphs
- Types of graph traversal (BFS and DFS)
- Separate collections
- Covering trees
- Shortest routes
- Network flow
- More advanced topics (LCA, network flow, graph competition problems)
This course is suitable for people who:
- They are looking for deep and applied graph learning.
- They want to succeed in technical interviews at large companies.
- Interested in solving complex problems using graph algorithms.
- Have basic knowledge of data structures and the C++ programming language.
