|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/graph-algorithms/
课程评论：没有评论
课程名称：图论算法可视化 课程概述： 该课程旨在教授图论的基本概念和算法，辅以实际案例和生动的可视化效果。课程将涵盖多种图论主题，包括图的表示、图的遍历、拓扑排序、最短路径、最小生成树以及图着色等，总共涉及20多种算法。所讨论的算法将通过编程语言进行详细实现，以便帮助学生更好地理解。课程中还将提供字幕、练习题、小测验、幻灯片及源代码，提升学习体验。课程结束时，学生将对图论算法有深入理解，并能将所学应用于计算机科学、数学等领域的问题解决。 目标受众： 本课程非常适合希望在计算机科学、数学或相关领域追求职业发展的学生，以及希望扩展图论算法知识的专业人士。 覆盖的算法包括： - 图的遍历：深度优先搜索、广度优先搜索 - 拓扑排序：基于深度优先搜索的拓扑排序、基于广度优先搜索的拓扑排序（Kahn算法） - 最短路径算法：Dijkstra算法、Bellman-Ford算法、Floyd-Warshall算法、Johnson算法、无权图的最短路径算法、有向无环图的最短路径算法、A*算法 - 树和最小生成树：生成树算法、图到出树算法、Prim算法、Kruskal算法 - 欧拉路径与哈密顿路径：Hierholzer算法、哈密顿回路回溯算法 - 图着色：2-可着色算法、k-可着色回溯算法、贪心着色算法、Welsh-Powell启发式、DSatur启发式 - 旅行推销员问题：暴力解法、回溯解法、动态规划解法、最近邻算法、排序边缘算法、Christofides算法 - 最大流问题：Ford-Fulkerson算法、Edmonds-Karp算法、Dinic算法、Hopcroft-Karp算法 该课程为学习和掌握图论算法提供了全面的基础，适合各类希望深入该领域的学员。
WARNING: The instructor is not currently available to answer questions regarding this courseThis 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 traversal:Depth-first searchBreadth-first searchTopological sorting:Depth-first search based topological sortBreadth-first search based topological sort (Kahn's algorithm)Shortest path:Dijkstra's algorithmBellman-Ford algorithmFloyd-Warshall algorithmJohnson's algorithmShortest path for unweighted graphs algorithmShortest path for directed acyclic graphsA* 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 heuristicTraveling Salesman Problem:TSP Brute force solutionTSP Backtracking solutionTSP Dynamic programming solutionNearest Neighbor algorithmSorted Edges algorithmChristofides algorithmMaximum flow problem:Ford-Fulkerson algorithmEdmonds-Karp algorithmDinic's algorithmHopcroft-Karp algorithm
