Home    Tutorials    IT & Software    Graph Theory Algorithms in Java

Graph Theory Algorithms in Java

 Admin0,

Learn and understand graph theory algorithms in computer science. Solve frequently asked graph coding interview problems

Welcome to the course – “Graph Theory Algorithms in Java”.

What you’ll learn

  • Representation of Graphs.
  • BFS (Breadth First Search) Algorithm.
  • DFS (Depth First Search) Algorithm.
  • Most Frequent & Popular Graph Coding Interview Problems.

Course Content

  • Introduction –> 1 lecture • 2min.
  • 1- Types of Graph –> 1 lecture • 4min.
  • 2- Adjacency Matrix Representation of Graph –> 2 lectures • 37min.
  • 3- Adjacency List Representation of Graph –> 2 lectures • 22min.
  • 4- BFS & DFS Algorithm –> 1 lecture • 13min.
  • 5- BFS on Matrix –> 1 lecture • 30min.
  • 6- BFS on Adjacency List –> 1 lecture • 26min.
  • 7- DFS on Matrix –> 1 lecture • 20min.
  • 8- DFS on Adjacency List –> 1 lecture • 27min.
  • 9- Number of Islands –> 1 lecture • 25min.
  • 10- Islands Perimeter –> 1 lecture • 29min.
  • 11- Count Sub Islands –> 1 lecture • 22min.
  • 12- 01 Matrix –> 1 lecture • 15min.
  • 13- Shortest Cell Path –> 1 lecture • 34min.
  • 14- Surrounded Regions –> 1 lecture • 25min.
  • 15- Pacific Atlantic Waterflow –> 1 lecture • 39min.
  • 16- Clone a Graph — BFS –> 1 lecture • 27min.
  • 17- Clone a Graph — DFS –> 1 lecture • 16min.
  • 18- Barpartitie Graph — BFS –> 1 lecture • 24min.
  • 19- Barpartitie Graph — DFS –> 1 lecture • 30min.
  • 20- All Path from Source to Destination — BFS –> 1 lecture • 10min.
  • 21- All Path from Source to Destination — DFS –> 1 lecture • 9min.
  • 22- Detect Cycle in an Undirected Graph — BFS –> 1 lecture • 21min.
  • 23- Detect Cycle in an Undirected Graph — DFS –> 1 lecture • 12min.
  • 24- Detect Cycle in a Directed Graph — BFS –> 1 lecture • 21min.
  • 25- Detect Cycle in a Directed Graph — DFS –> 1 lecture • 16min.
  • 26- Topological Sort — DFS –> 1 lecture • 20min.
  • 27- Topological Sort — BFS –> 1 lecture • 18min.

Graph Theory Algorithms in Java

Requirements

Welcome to the course – “Graph Theory Algorithms in Java”.

 

This course provides a complete overview of Graph Theory algorithms.

Graph Theory is an advanced topic in Computer Science. This course will offer you the opportunity to gain a solid understanding in Graph Theory. Graphs are used to solve many real-life problems. Graphs are used to represent networks. The networks may include paths in a city or telephone network or circuit network. Graphs are also used in social networks like linkedIn, Facebook. For example, in Facebook, each person is represented with a vertex(or node). Each node is a structure and contains information like person id, name, gender, locale etc.

 

Why you should learn Graph Theory?

Not interested in graphs? Whether you like them or not, practical use of graph data structures and graph algorithms is all around us. They are powerful, versatile, widely spread and used by everyone, without even knowing it: Google maps uses graphs for building transportation systems, Facebooks friend suggestion uses graph theory (Facebook users are vertices and if they are friends there is an edge running between them), every modelling of social networks, Windows file explorer; you’re even using graph algorithms while reading this — the internet is a collection of hosts and routers connected by various links, for host A to find host B it must find an optimal path through all this mess. Other than the IT world, graphs have very wide usage in linguistics, chemistry, physics, biology and, of course, mathematics.

 

This course contains:

  • Graph Representation using Adjacency Matrix
  • Graph Representation using Adjacency List
  • Graph Traversal Algorithm, BFS (Breadth First Search) and DFS (Depth First Search)
  • Different types of Graph Algorithms
  • Most Common and Frequently Asked Graph Questions

 

Watch some preview video, if you are interested enrol this course 🙂

 

See you inside 🙂

Get Tutorial