English | MP4 | AVC 1280×720 | AAC 48KHz 2ch | 2.5 Hours | 272 MB
eLearning | Skill level: All Levels
Lets implement graph theory related algorithms with C++
Graph theory hold corner stone of modern computer science, extending its tentacles to social networks to neural networks to finding paths in maps. In this course we are looking at graph theory by computer science prospective. 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.
- Graph traversing.
- Topological sorting and strongly connected component associated algorithms
- Shortest paths.
- Finding minimum spanning trees.
- Maximum flow.
- NP complete algorithms such as graph coloring, traveling salesman problem etc.
Introduction to graph theory
1 Some points before you start
3 Lets learn some jargon part 1
4 Lets learn some jargon part 2
5 Adjacency matrix representation of a graph
6 Adjacency list representation of a graph
7 Comparison between two implementations
Graph traversing algorithms
8 Breadth first search
9 Breadth first search implementation
10 Depth first search
11 Predecessor sub graphs
12 Classification of edges in predecessor sub graph
13 Topological search of a directed graph
14 Topological sort implementation
15 Strongly connected component of a graph
16 Strongly connected component of a graph implementation
Shortest path in a graph
17 Shortest path algorithms introduction
18 Bellman ford algorithm
19 Bellman ford algorithm implementation
20 Shortest path in DAG
21 Dijkstras algorithm of finding shortest path
22 Dijkstras algorithm of finding shortest path explanation
23 Dijkstras algorithm of finding shortest path implementation
Minimum spanning tree problem
24 Minimum spanning tree introduction
25 MST- Kruskals algorithm introduction part 1
26 MST-Kruskals algorithm introduction part 2
27 MST-Kruskals algorithm implementation
28 MST-Prims algorithm introduction
29 MST-Prims algorithm implementation
30 Introduction to flow networks
31 Max flow min cut theorem