Have a question?
Message sent Close
4.8 out of 5
4.8
35 reviews on Udemy

Graph Theory Algorithms in Java

Learn and understand graph theory algorithms in computer science. Solve frequently asked graph coding interview problems
Instructor:
Md. A. Barik
11,907 students enrolled
English [Auto]
Representation of Graphs
BFS (Breadth First Search) Algorithm
DFS (Depth First Search) Algorithm
Most Frequent & Popular Graph Coding Interview Problems

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 🙂

2- Adjacency Matrix Representation of Graph

6- BFS on Adjacency List

8- DFS on Adjacency List

13- Shortest Cell Path

15- Pacific Atlantic Waterflow

18- Barpartitie Graph -- BFS

19- Barpartitie Graph -- DFS

20- All Path from Source to Destination -- BFS

21- All Path from Source to Destination -- DFS

22- Detect Cycle in an Undirected Graph -- BFS

23- Detect Cycle in an Undirected Graph -- DFS

24- Detect Cycle in a Directed Graph -- BFS

25- Detect Cycle in a Directed Graph -- DFS

27- Topological Sort -- BFS

You can view and review the lecture materials indefinitely, like an on-demand channel.
Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don't have an internet connection, some instructors also let their students download course lectures. That's up to the instructor though, so make sure you get on their good side!
4.8
4.8 out of 5
35 Ratings

Detailed Rating

Stars 5
24
Stars 4
11
Stars 3
0
Stars 2
0
Stars 1
0
5c6f580bc5794448ecee05ef842e8866
30-Day Money-Back Guarantee

Includes

10 hours on-demand video
1 article
Full lifetime access
Access on mobile and TV
Certificate of Completion

External Links May Contain Affiliate Links read more

Join our Telegram Channel To Get Latest Notification & Course Updates!
Join Our Telegram For FREE Courses & Canva PremiumJOIN NOW