|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/byte-sized-chunks-graph-algorithms-and-problems-in-java/
课程评论：没有评论
课程名称：Byte-Sized-Chunks: 图算法和问题在Java中的应用 课程概述：本课程是更长课程“从0到1：数据结构与算法”的一个子集，因此请勿同时报名。该课程通过动画、视觉和空间化的方式教授数据结构和算法。我们的大脑对不同类型的信息处理方式存在差异，进化使我们在视觉和空间信息的吸收上表现最佳，也就是说，当我们能够闭上眼睛想象时，理解效果更佳。相比其他概念，数据结构和算法更适合通过视觉来学习，视觉学习简单易懂，而其他方式则难以把握。 本课程由在Google、Microsoft和Flipkart等公司拥有丰富实际经验的团队编写，课程讲师是一位斯坦福大学毕业的前Google员工。图是一种用于建模大量现实世界问题的数据结构，而且在编程面试中非常受欢迎。图的研究及其相关算法形成了一个完整的研究领域，被称为图论。本课程将涵盖以下内容： - 有向图和无向图 - 邻接矩阵、列表和集合 - 广度优先遍历和深度优先遍历 - 拓扑排序 - Dijkstra算法 - Bellman-Ford算法 - Prim算法 - Kruskal算法 该课程旨在通过视觉化的学习方式，帮助学生更好地理解图算法及其在实际问题中的应用。
Note: This course is a subset of our much longer course 'From 0 to 1: Data Structures & Algorithms' so please don't sign up for both:-) This is an animated, visual and spatial way to learn data structures and algorithms Our brains process different types of information differently - evolutionarily we are wired to absorb information best when it is visual and spatial i.e. when we can close our eyes and see itMore than most other concepts, Data Structures and Algorithms are best learnt visually. These are incredibly easy to learn visually, very hard to understand most other waysThis course has been put together by a team with tons of everyday experience in thinking about these concepts and using them at work at Google, Microsoft and Flipkart Taught by a Stanford-educated ex-Googler. The graph is a data structure that is used to model a very large number of real world problems. It's also an programming interview favorite. The study of graphs and algorithms associated with graphs forms an entire field of study called graph theory. Directed and undirected graphsAdjacency matrices, lists and setsBreadth and Depth-First traversalTopological sortDjikstra's algorithmBellman-Ford algorithmPrim's algorithmKruskal's algorithm
