Advanced Algorithms (Graph Algorithms) in Java

Advanced Algorithms (Graph Algorithms) in Java
MP4 | Video: h264, 1920×1080 | Audio: AAC, 44.1 KHz

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
Who this course is for:
This course is meant for everyone from scientists to software developers who want to get closer to algorithmic thinking in the main

For More Courses Visit & Bookmark Your Preferred Language Blog