Advanced Algorithms (Graph Algorithms) in Java

Advanced Algorithms (Graph Algorithms) in Java

Graph Algorithms, Breadth-First Search, Depth-First Search, Shortest Path, Arbitrage and Strongly Connected Components

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)


  • Internet connection
  • Basic knowledge of data structures


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 – 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

find way out of a maze with DFS

Section 4 – Topological Ordering

what is topological ordering (topological sort)

directed acyclic graphs (DAGs)

DAG shortest path and longest path

critical path methods and project management

Section 5 – Cycle Detection

what are cycles in a graph?

forward edges and backward edges

cycle detection algorithms (Tarjan’s algorithm with DFS)

Section 6 – Dijkstra’s Shortest Path Algorithm

what is a shortest path in a G(V,E) graph

Dijkstra’s shortest path algorithm

Section 7 – Bellman-Ford Shortest Path Algorithm

Bellman-Ford algorithm

how to handle negative cycles

finding arbitrage opportunities on the FOREX

The course is going to take approximately 11 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!

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


Leave a Reply

Your email address will not be published. Required fields are marked *

%d bloggers like this: