Advanced Algorithmics and Graph Theory with Python

Description

In this course, you will learn:

• Graph theory can be used to express a computer problem (such as pathfinding)
• How to select the most acceptable algorithm for a particular computing task
• In Python, how to code the algorithmic solution
• Methods for assessing the proposed solution's complexity (resource allocation, scalability) or performance (accuracy, latency)

Syllabus:

1. Fundamentals of Graph Theory, Problem Solving, Good Programming Practices
2. Graph Traversal, Routing, Queuing Structures
3. Shortest Paths, Min-Heaps, Algorithmic Complexity
4. NP-Completeness, Traveling Salesman Problem, Backtracking
5. Heuristics, Greedy Approaches, Accuracy/Complexity tradeoff
6. Combinatorial Game Theory, Winning Strategies