Advanced Algorithms (Graph Algorithms) in Java Course includes 11 hrs video content and enrolled by 13K+ students and received a 4.6 average review out of 5. Now, you will get 94%OFF on the original price of the course and discount price differs from country to country, and the course provider offers 30-days money-back guarantee! If you are not satisfied in any way, you’ll get your money back.
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
Section 1 – Graphs Theory Basics:
- what is a G(V,E) graph
- adjacency matrix representation
- adjacency list representation
Section 2 – Graph Traversal (Breadth-First Search)
- what is breadth-first search?
- how to use BFS for WebCrawling in search engines?
Section 3 – Graph Traversal (Depth-First Search)
- what is depth-first search?
- how to use recursion to implement DFS
- applications of DFS such as topological ordering and cycle detection
Section 4 – Dijkstra’s Shortest Path Algorithm
- what is a shortest path in a G(V,E) graph
- Dijkstra’s shortest path algorithm
Section 5 – Bellman-Ford Shortest Path Algorithm
- Bellman-Ford algorithm
Section 6: – Spanning Trees (Kruskal and Prim’s Algorithms)
- what are spanning trees
- union find data structures
- Kruskal’s algorithm
- Prim’s algorithm
Section 7 – Strongly Connected Components (SCCs)
- what are strongly connected components
- Kosaraju’s algorithm
- Tarjan’s algorithm
Section 8 – Maximum Flow Problem
- the famous maximum flow problem
- how to reduce most of the hard problems to maximum flow problem
- Ford-Fulkerson algorithm
- bipartite matching problem
Section 9 – Travelling Salesman Problem and Hamiltonian Cycles:
- travelling salesman problem (TSP)
- how to deal with NP-hard problems
- what are meta-heuristics
Section 10 – Eulerian Paths
- eulerian paths and eulerian cycles
- Hierholzer algorithm and the Chinese Postman Problem
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
Can I download Advanced Algorithms (Graph Algorithms) in Java course?
Course videos can be downloaded for offline viewing using the Udemy mobile app on Android and iOS. Some courses may allow downloading lectures on a computer only if the instructor has enabled it, but this is not guaranteed and is not the primary method Udemy supports.Can I get a certificate after completing the course?
Yes. After successful completion of the Advanced Algorithms (Graph Algorithms) in Java, learners will receive a certificate of completion. The certificate confirms that the course has been completed and can be downloaded and shared on resumes or professional profiles.Are there any other coupons available for this course?
Additional coupons for this course may be available from time to time. Coupon availability is time-limited and may change or expire at any time, so it’s recommended to check regularly for updated offers.Disclosure: This post may contain affiliate links and we may get small commission if you make a purchase. Read more about Affiliate disclosure here.
