|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/graph-theory-and-its-algorithms/
课程评论：没有评论
Coursera 课程“图论及其算法 - 高级数据结构与算法”概述： 本课程深入探讨图论的核心概念及其在解决现实问题中的应用。课程内容涵盖： * **图数据结构基础**: 什么是图数据结构，及其基本组成（顶点和边）。 * **图的类型**: 详细介绍加权图、无权图、有向图、无向图、有环图、无环图、有向无环图等。 * **图的表示方法**: * 邻接表 (Adjacency List) * 邻接矩阵 (Adjacency Matrix) * 并提供使用面向对象编程（OOPS）在Python中实现这些表示方法的代码。 * **核心图算法**: * **深度优先搜索 (DFS)**：及其在拓扑排序、求和、最大值、最小值等问题中的应用。 * **广度优先搜索 (BFS)** * **单源最短路径问题**: * Dijkstra 算法（算法原理及 Python 实现） * Bellman-Ford 算法（算法原理及 Python 实现） * **最小生成树问题**: * 生成树的概念 * Prim 算法 * Kruskal 算法 **先修知识**: 建议具备基本数据结构和 Python 编程知识。
I welcome you all to my course on 'Graph Theory and it's Algorithms - Advanced DSA'This course deals with the concepts of Graph Theory such as1. What is Graph Data Structure? 2. Applications of Graphs to solve real life problems. 3. Terminologies involved in Graph Theory4. Types of Graph Data Structure - Weighted, Unweighted, Directed, Undirected, Cyclic, Acyclic, Directed Acyclic Graphs. This course also gives the explanation of the following algorithms and also provide their implementation in Python. 1. Representation of Graphs - Adjacency List, Adjacency Matrix. 2. Implementation of Adjacency List, Adjacency Matrix using OOPS in Python. 3. Depth First Search (DFS) Algorithm in Python4. Breadth First Search (BFS) 5. Problems based on DFS - Topological Sort, Sum, Max, Min. Single Source Shortest Path Problems. 1. Djikstra's Algorithm - Algorithm and Code in Python. 2. Bellman Ford - Algorithm and Code in Python.Minimum Spanning Tree Problems1. Explanation of Spanning Trees, Finding out Minimum Spanning Tree. 2. Prim's and Kruskal's Algorithm. Note: Knowledge in Basic Data Structures and Python is preferred. A graph data structure consists of a finite (and possibly mutable) set of vertices (also called nodes or points), together with a set of unordered pairs of these vertices for an undirected graph or a set of ordered pairs for a directed graph. These pairs are known as edges (also called links or lines), and for a directed graph are also known as edges but also sometimes arrows or arcs. The vertices may be part of the graph structure, or may be external entities represented by integer indices or references.
