• Post category:StudyBullet-13
  • Reading time:8 mins read


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

What you will learn

Representation of Graphs

BFS (Breadth First Search) Algorithm

DFS (Depth First Search) Algorithm

Most Frequent & Popular Graph Coding Interview Problems

Description

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?


Get Instant Notification of New Courses on our Telegram channel.


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 πŸ™‚

English
language

Content

Introduction

Introduction

1- Types of Graph

Different types of graph

2- Adjacency Matrix Representation of Graph

Undirected Graph
Directed Graph

3- Adjacency List Representation of Graph

Undirected Graph
Directed Graph

4- BFS & DFS Algorithm

BFS & DFS Algorithm

5- BFS on Matrix

BFS on matrix

6- BFS on Adjacency List

BFS on adjacency list

7- DFS on Matrix

DFS on Matrix

8- DFS on Adjacency List

DFS on adjacency list

9- Number of Islands

Number of islands

10- Islands Perimeter

Island Perimeter

11- Count Sub Islands

Count Sub Islands

12- 01 Matrix

01 Matrix

13- Shortest Cell Path

Shortest cell path

14- Surrounded Regions

Surrounded regions

15- Pacific Atlantic Waterflow

Pacific Atlantic Waterflow

16- Clone a Graph — BFS

Clone a graph — BFS

17- Clone a Graph — DFS

Clone a graph — dfs

18- Barpartitie Graph — BFS

Barpartitie graph — BFS

19- Barpartitie Graph — DFS

Barpartitie graph — DFS

20- All Path from Source to Destination — BFS

All Path from Source to Destination — BFS

21- All Path from Source to Destination — DFS

All Path from Source to Destination — DFS

22- Detect Cycle in an Undirected Graph — BFS

Detect Cycle in an Undirected Graph — BFS

23- Detect Cycle in an Undirected Graph — DFS

Detect Cycle in an Undirected Graph — DFS

24- Detect Cycle in a Directed Graph — BFS

Detect Cycle in a Directed Graph — BFS

25- Detect Cycle in a Directed Graph — DFS

Detect Cycle in a Directed Graph — DFS

26- Topological Sort — DFS

Topological Sort — DFS

27- Topological Sort — BFS

Topological sort — BFS