Learn Graph Algorithms with C++ Programming

图用于解决许多现实生活中的问题。图用于表示网络。网络可以包括城市或电话网络或电路网络中的路径。图还用于诸如linkedIn，Facebook之类的社交网络中。例如，在Facebook中，每个人都用一个顶点（或节点）表示。每个节点都是一个结构，并包含诸如个人ID，姓名，性别，语言环境等信息。

我们将通过研究图论的基本术语来开始我们的讨论，然后他们继续讨论图论相关的算法，然后使用c ++来实现这些算法。以下是我们将在本课程中讨论的算法类型。

在本课程中，我们将实现许多重要算法，例如DFS，BFS，Kruskals，PRims和Dijastra算法。

我们将了解如何在给定图，有向图，生成树，最小生成树等中找到路径。

最小生成树

其所有边的权重（或长度）之和小于图G的所有其他可能的生成树的生成树称为最小生成树或最小成本生成树。

为了实现最小成本生成树，使用以下两种方法-

普里姆算法

克鲁斯卡尔算法

Dijkstra的算法与最小生成树的Prim算法非常相似。像Prim的MST一样，我们以给定的源为根来生成SPT（最短路径树）。我们维护两组，一组包含最短路径树中包含的顶点，另一组包含尚未包含在最短路径树中的顶点。在算法的每个步骤中，我们都找到一个顶点，该顶点在另一个集合（尚未包括的集合）中，并且与源的距离最小。

MP4 | Video: h264, 1280×720 | Audio: AAC, 44.1 KHz, 2 Ch
Genre: eLearning | Language: English + srt | Duration: 19 lectures (4h 39m) | Size: 2.5 GB
From Scratch implement Graphs important Algorithms like DFS, BFS, Kruskals ,Prims and Dijastra’s Algorithms in C++

What you’ll learn:
Thorough Understanding about Graph Algorithms .
Depth First Search and Breadth First Search.
From scratch Implementation of DFS and BFS Algorithms.
From scratch Implementation of Important algorithms like Kruskals, PRims and Dijastra’s Algorithm
Spanning Trees and MST

Requirements
Programming Knowledge in C++

Description
Graphs are used to solve many real-life problems. Graphs are used to represent networks. The networks may include paths in a city or telephone network or circuit network. Graphs are also used in social networks like linkedIn, Facebook. For example, in Facebook, each person is represented with a vertex(or node). Each node is a structure and contains information like person id, name, gender, locale etc.

We are going to start our discussion by looking at the basic terms of graph theory and them jump on to discuss graph theory related algorithms and then implement those with c++. Following are the types of algorithms we are going to discuss in this course.

In this Course we shall Implement many Importants Algorithms like DFS ,BFS, Kruskals, PRims and Dijastra’s Algorithms.

We shall understand how to find path in a given graph ,Directed Graphs ,Spanning Trees ,Minimum spanning trees etc.

Minimal Spanning Tree

A spanning tree whose sum of weight (or length) of all its edges is less than all other possible spanning tree of graph G is known as a minimal spanning tree or minimum cost spanning tree.

To implement the minimum cost-spanning tree, the following two methods are used −

Prim’s Algorithm

Kruskal’s Algorithm

Dijkstra’s algorithm is very similar to Prim’s algorithm for minimum spanning tree. Like Prim’s MST, we generate a SPT (shortest path tree) with given source as root. We maintain two sets, one set contains vertices included in shortest path tree, other set includes vertices not yet included in shortest path tree. At every step of the algorithm, we find a vertex which is in the other set (set of not yet included) and has a minimum distance from the source.

Who this course is for
Any C++ programmer who wants to learn Graph Important Algorithms
Who wants to learn how to implement important algorithms like DFS and BFS in Graphs
Who wants to learn how to Implement algorithms like Kruskals, PRims and Dijastra’s Algorithm in Graphs