|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/graph-theory-algorithms-for-competitive-programming/
课程评论：没有评论
课程名称：竞争编程的图论算法 课程概述： 欢迎来到竞争编程的图算法课程——为竞争程序员、软件工程师和计算机科学学生量身打造的最详细的图论专业课程！图论是软件工程师必备的知识，无论是在学术研究、在线竞赛，还是解决现实生活中的挑战中，图算法都是基础。许多流行应用（如谷歌地图、社交媒体应用如Facebook、Instagram、Quora、LinkedIn、计算机视觉应用，如图像分割、编译时解决依赖关系、供应链中的车辆调度问题等）都依赖于图算法。 本课程提供了计算机科学中图论算法的详细概述，并教授所有算法的C++实现。更重要的是，您将获得80多个竞争编程问题，以练习和测试您的技能！该课程由在谷歌工作的Prateek Narang和Apaar Kamal教授，二人已在过去五年中教授了成千上万的学生竞争编程。虽然本课程价值数千美元，但Coding Minutes将以极具竞争力的价格提供给您！ 这是一门注重实践的课程，不仅探讨理论，还专注于通过构建实现算法和解决问题来强化实践能力。课程包含95个以上高质量视频讲座，解释清晰易懂，是目前为止图算法课程中最全面和严谨的一门。 课程分为两个部分： 第一部分：图论基础 - 图的表示 - 常见遍历算法：广度优先搜索（BFS）与深度优先搜索（DFS） - 循环检测：加权图与无权图 - 拓扑排序与有向无环图（DAG） - 不相交集合，路径压缩与按秩合并 - 最小生成树：普里姆算法与克鲁斯卡尔算法 - 最短路径算法：BFS、Dijkstra、Bellman-Ford、Floyd-Warshall - 旅行售货员问题，最小成本哈密顿回路 第二部分：高级图论 - 洪泛填充（Flood Fill） - 多源BFS - DFS与回边 - 强连通分量（SCC）与Kosaraju算法 - 欧拉巡回（Euler Tour） - 最近公共祖先（LCA） - 树 - 关节点与桥 - 网络流 第二部分推荐给希望深入竞争编程并参与竞赛的程序员。对于大多数学生而言，第一部分足以理解图的基本概念和技巧。 特别感谢来自德里技术大学的问题设定者Siddharth Singhal和Rajdeep，他们帮助我们打造了完整的课程题库。您还在等什么？立即注册，开始深入学习图论吧！
Welcome to Graph Algorithms for Competitive Coding - the most detailed Specialisation in Graph Theory for Competitive Programmers, Software Engineers & Computer Science students!Graphs is quite an important topic for software engineers, both for academics & online competitions and for solving real life challenges. Graph algorithms form the very fundamentals of many popular applications like - Google Maps, social media apps like Facebook, Instagram, Quora, LinkedIn, Computer Vision applications such as image segmentation, resolving dependencies while compile time, vehicle routing problems in supply chain and many more. This course provides a detailed overview of Graph Theory algorithms in computer science, along with hands on implementation of all the algorithms in C++. Not just that you will get 80+ competitive coding questions, to practice & test your skills! This comprehensive course is taught by Prateek Narang & Apaar Kamal, who are Software Engineers at Google and have taught over thousands of students in competitive programming over last 5+ years. This course is worth thousands of dollars, but Coding Minutes is providing you this course to you at a fraction of its original cost! This is action oriented course, we not just delve into theory but focus on the practical aspects by building implementing algorithms & solving problems. With over 95+ high quality video lectures, easy to understand explanations this is one of the most detailed and robust course for Graph Algorithms ever created.Course starts very basics with how to store and represent graphs on a computer, and then dives into popular algorithms & techniques for problem solving. The course is divided into two parts.Part-I Graph Theory EssentialsGraph RepresentationsPopular Traversals - BFS & DFSCycle Detection - Weighted & Unweighted GraphsTopological Ordering & Directed Acyclic GraphsDisjoint Set Union, Path Compression & Union by RankMinimum Spanning Trees - Prim's & Kruskal'sShortest Paths - BFS, Dijkstra's, Bellman Ford, Floyd WarshallTravelling Salesman Problem, Min Cost Hamiltonian CyclePart-II Graph Theory AdvancedFlood FillMultisource BFSDFS & BackedgesSCC's & Kosaraju's AlgorithmEuler TourLCATreesArticulation Points & BridgesNetwork Flow The part-II is recommended for programmers who want to deep dive into Competitive Programming & take part in contests. For most students part-I is good enough to understand the most fundamental concepts and techniques in graphs! Our special thanks to our problem setters, Siddharth Singhal & Rajdeep from Delhi Technological University, who helped us crafting the complete problem-set for this course. So what you are waiting for ? Sign up today & start your deep-dive into graph theory!
