Advanced Algorithms (Graph Algorithms) in Java
Free Coupon Discount - Advanced Algorithms (Graph Algorithms) in Java, Graph algorithms, breadth-first search, depth-first search, shortest path, arbitrage, strongly connected components
Students also bought
Preview this Udemy Course GET COUPON CODE
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.
Section 1:
the basic graph traversal algorithm
breadth-first search algorithm
depth-first search algorithm
Section 2:
shortest path algorithms
Dijkstra's algorithm
Bellman-Ford algorithm
Section 3:
what are spanning trees
union find data structures
Kruskal's algorithm
Prim's algorithm
Section 4:
what are strongly connected components
Kosaraju algorithm
Tarjan algorithm
Section 5:
the famous maximum flow problem
how to reduce most of the hard problems to maximum flow problem
Ford-Fulkerson algorithm
bipartite matching problem
Section 6:
travelling salesman problem (TSP)
how to deal with NP-hard problems
using meta-heuristics: tabu search and simulated annealing
Section 7:
eulerian paths and eulerian cycles
Hierholzer algorithm and the Chinese Postman Problem
The course is going to take approximately 10 hours to completely but I highly suggest you typing these algorithms out several times in order to get a good grasp of it. You can download the source code of the whole course at the last lecture.
You should definitely take this course if you are interested in advanced topics concerning algorithms. There are a bunch of fields where these methods can be used: from software engineering to scientific research.
Thanks for joining the course, let's get started!
100% Off Udemy Coupon . Free Udemy Courses . Online Classes
Students also bought
- Java Multithreading, Concurrency & Performance Optimization
- Java Design Patterns & SOLID Design Principles
- Complete JDBC Programming Part-1
- Efficient Java Multithreading and Concurrency with Executors
- Functional & Reactive programming in Java : Modern Style
- From 0 to 1: Data Structures & Algorithms in Java
Preview this Udemy Course GET COUPON CODE
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.
Section 1:
the basic graph traversal algorithm
breadth-first search algorithm
depth-first search algorithm
Section 2:
shortest path algorithms
Dijkstra's algorithm
Bellman-Ford algorithm
Section 3:
what are spanning trees
union find data structures
Kruskal's algorithm
Prim's algorithm
Section 4:
what are strongly connected components
Kosaraju algorithm
Tarjan algorithm
Section 5:
the famous maximum flow problem
how to reduce most of the hard problems to maximum flow problem
Ford-Fulkerson algorithm
bipartite matching problem
Section 6:
travelling salesman problem (TSP)
how to deal with NP-hard problems
using meta-heuristics: tabu search and simulated annealing
Section 7:
eulerian paths and eulerian cycles
Hierholzer algorithm and the Chinese Postman Problem
The course is going to take approximately 10 hours to completely but I highly suggest you typing these algorithms out several times in order to get a good grasp of it. You can download the source code of the whole course at the last lecture.
You should definitely take this course if you are interested in advanced topics concerning algorithms. There are a bunch of fields where these methods can be used: from software engineering to scientific research.
Thanks for joining the course, let's get started!
100% Off Udemy Coupon . Free Udemy Courses . Online Classes
Post a Comment for "Advanced Algorithms (Graph Algorithms) in Java"