Learn Graph Algorithms with C++ Programming-0daytown

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

Learn Graph Algorithms with C++ Programming