Graph theory algorithms visualized

Unleash the power of graph theory with cutting-edge algorithms
Unleash the power of graph theory with cutting-edge algorithms
What you'll learn
Learn graphs terminology and representation
Learn graph traversal
Learn algorithms related to various graph theory topics (shortest paths, minimum spanning trees...)
Solve graph related coding interview problems
Requirements
Basic programming knowledge
Algorithmic techniques knowledge is preferred (recursion, backtracking, dynamic programming...)
Data structures knowledge is preferred (hash table, queue, stack, set, heap...)
Description
This Graph theory algorithms will teach students the fundamental concepts and algorithms of graph theory with real life examples and eye-appealing visualizations. The course will cover topics such as graph representation, graph traversal, topological sort, shortest paths, minimum spanning trees, graph coloring... With a total of more than 20 covered algorithms. Discussed algorithms will be implemented in detail by using a programming language to give a better understanding for students. Captions, practice problems, quizzes, slides, and source code will also be here to make the learning experience way better. By the end of the course, students will have a strong understanding of graph algorithms and be able to apply their knowledge to solve problems in computer science, mathematics, and beyond.This course is ideal for students who are looking to pursue careers in computer science, mathematics, or related fields, as well as for professionals who want to expand their knowledge of graph theory algorithms.Covered algorithms:Graph traversalepth-first searchBreadth-first searchTopological sortingepth-first search based topological sortBreadth-first search based topological sort (Kahn's algorithm)Shortest pathijkstra's algorithmBellman-Ford algorithmFloyd-Warshall algorithmJohnson's algorithmShortest path for unweighted graphs algorithmShortest path for directed acyclic graphs (1st approach) algorithmShortest path for directed acyclic graphs (2nd approach) algorithmTrees and minimum spanning trees:Spanning tree algorithmGraph to out-tree algorithmPrim's algorithmKruskal's algorithmEulerian/Hamiltonian paths and cycles:Hierholzer's algorithmHamiltonian cycle backtracking algorithmGraph coloring:2-colorability algorithmk-colorability backtracking algorithmGreedy coloring algorithmWelsh-Powell heuristicDSatur heuristic
Who this course is for
Computer science students
Data science beginners
Software development beginners
HOMEPAGE