|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/amazing-graph-algorithms-coding-in-javajavascript-python/
课程评论：没有评论
**课程名称：** 绝妙图算法：使用 Java、JavaScript 和 Python 编程 **课程概述：** 本课程将带您深入探索图算法的精彩世界，并提供 Java、JavaScript 和 Python 的实现。我们将从图的遍历开始，详细讲解深度优先搜索 (DFS) 和广度优先搜索 (BFS) 这兩種高效的遍历方法。 随后，我们将学习生成树（Spanning Trees），特别是最小生成树（Minimum Cost Spanning Tree）。通过电信塔连接的例子，您将理解如何使用最小生成树算法来最小化连接所有顶点的总成本。 接着，我们将重点关注最短路径算法，包括求解单源最短路径（从一个源点到所有其他顶点的最短距离）和所有点对最短路径（所有顶点之间的最短距离）。我们将通过规划旅行路线的例子，说明如何找到最经济或最快捷的出行方式。 此外，课程还将涵盖网络流问题，包括最大流问题（在网络中最大化流量）和最小割问题（以最小成本断开源点与汇点）。 最后，我们将学习如何查找图中的强连通分量。 希望您能享受本课程的学习过程，并在编程实践中体会图算法的魅力！
Graphs are Amazing! We will have a lot to cover in this course also the course is coded in Java, JavaScript & Python.While solving graph algorithms, We may need to visit and process each node present in the graph. And for that, we must know how to traverse the graphs efficiently,So, first, we will cover graph traversal, where we gonna see the 2 types of graph traversals, Depth First Search, and Breadth-first Search.Then we will understand Spanning Trees and will see famous algorithms to find minimum cost spanning tree, basically, a minimum cost spanning tree is a tree from the graph connecting all the vertices with single edges each and that allOf the lowest cost, so to minimize the cost to connect all the vertices.For example:Suppose, you own a telecommunication company and you have towers that spread across the state. You want to connect them so that data can be passed from one tower to others.Connecting different towers involve different costs, so the problem is how will you minimize the cost. Here, comes the need of using Minimum spanning tree algorithms to findThat tree connecting all the towers with edges that have a minimum cost, so that the spanning Tree cost is minimum.After that, we will look to Shortest Path algorithms, these are useful to find the shortest distance from of a source from all the other vertices (called single-source shortest path) or shortest distance of each vertex with all the Other vertices, that's called finding all pair shortest path.For example, finding the distance of a city, let's say Istambul to all the other famous cities of turkey.Or let's say A person who is planning a trip may need to answer questions such as, "What is the least expensive way to get from Princeton to San Jose?" A person more interested in time than in money may need to know the answer to the question "What is the fastest way to get from Princeton to San Jose?" To answer such questions, we process information about connections (travel routes) between items (towns and cities).Then we will move to Flow network problems. These are concerned with the networks or graph, having a flow going through it. There will be problems that ask to maximize the flow across the network or problems that ask to disconnect the source from the destination or sink in minimum cost.After that we will discuss, algorithms to find strongly connected components in a graph.Hope you will enjoy the course.Happy Learning
