06 - Adjacency List Representation of Graph in JAVA | Data Structures | Graph Theory

This is the 6th video (JAVA edition) of the graph series from TOTN which I started recently out of the blue.

There are 2 most common ways to represent a Graph Data Structure -
1. Adjacency Matrix
2. Adjacency List

In this video, I have discussed the second approach of using Adjacency List to represent a Graph in JAVA.
I have used JAVA as the programming language to implement the same.

Space Complexity of Storing a Graph - O(|V| + |E|) where V is the number of vertices/nodes in the graph and E is the number of Edges in the graph.

The Time Complexity to determine if there is an edge between two vertices or not happens in O(V), where V is the number of vertices!

I try to upload the JAVA version of the code as well for some of the programs here. But sometimes when I do not have time, I do only the C++ version.

DIFFICULTY LEVEL - Easy (Upper End)
CATEGORY - Programming
PROGRAMMING/SCRIPTING LANGUAGE - JAVA
LANGUAGE - English
CONTENT - Adjacency List Implementation of Graph in JAVA

Happy Learning! :)
---------------------------------------------------------------------------------------------------------------------------
Why - To follow up with videos, I usually try to segregate all the things in a blog. For almost every YouTube video in this channel, you should find an associated blog that you can refer to.

Why - While scrolling Instagram if you find something knowledgable from my side? Won't it be beneficial? I bet it would be. I will be putting informational posts in the form of posters and short videos here.

Why - To find videos on this channel. (Self Referential Link)

Why - For thanking or cursing me! If you have any queries related to what I speak here in this channel, you can ping me those as well.
---------------------------------------------------------------------------------------------------------------------------