Last updated 6/2022MP4 | Video: h264, 1280x720 | Audio: AAC, 44.1 KHzLanguage: English | Size: 2.48 GB | Duration: 12h 30m
Breadth-First Search, Depth-First Search, Shortest Path, Arbitrage, Strongly Connected Components and Maximum Flow
What you'll learn
Learn about the applications of data structures
Learn about the fundamental basics of graphs and graph theory
Implement advanced algorithms (graph algorithms) efficiently
Learn graph traversing such as breadth-first search and depth-first search
Learn about topological ordering and cycle detection
Learn about shortest path algorithms (Dijkstra's and Bellman-Ford algorithms)
Learn about spanning trees
Learn about strongly connected components
Learn about Hamiltonian cycles and Eulerian cycles
Learn about maximum flow (max flow min cut theorem)
Requirements
Internet connection
Basic knowledge of data structures
Description
This course is about advanced algorithms (graph algorithms) focusing on graph traversal, shortest path problems, spanning trees and maximum flow problems and a lots of its applications from Google Web Crawler to taking advantage of stock market arbitrage situations.