G-3. Graph Representation in Java | Two Ways to Represent

[@takeUforward]

Lets continue the habit of commenting “understood” if you got the entire video.
Do follow me at Instagram: striver_79

[@ajeetstationajeet]

If I haven’t watched your previous graph series then can I directly start from here or should I watch your previous graph series at first please reply Bhaiya

[@ajeetstationajeet]

please reply ...............................................................................

[@ratnadeepsaha7675]

Concept of graph never changes. He started from basics. Continue watching this series.

[@CodeMode9313]

@striver bhaiya at 10:03 i think there was a bit error coz we need to use the for loop for all the nodes but you used from i=1 to i

[@rana4908]

please do a number theory course (Modular arithmetic etc). there are no quality videos on these topics and no one explains just like how you do

[@v5q211]

Kunal has a good one

[@suheabkhan2546]

understood!!! but no code for java people!!

[@frustrato2802]

Sir there has been a typo in your video
to print all the edges the first for loop shall have i

[@adrianagaraychavez7330]

this video was simply GREAT. I really loved it, it was so much help. I hope to keep learning from you :') Greetings from a Cuban Computer Science student :3

[@cinime]

Understood! Great explanation as always, thank you so much!!

[@rajatmehta7545]

was struggling to understand the basic from the last 2 days, finally got concept through this video

[@user-el6hv6em7m]

@striver at 8:55, I think the space complexity should be O (n + 2m) because irrespective of the number of edges we are gonna create empty lists for each of the vertex. Correct me if I am wrong?

[@hemanthkumar516]

we can use Arrays of list same as u did in c++ using vector -->List list[]=new ArrayList[n];

[@vinitjain7]

00:03 Learn how to store complex graph data in Java
01:47 Storing a graph can be done using adjacency matrix or adjacency list.
03:29 Adjacency matrix stores graph edges in a matrix
05:13 Adjacency list is a space-efficient way to store graph data.
07:00 Storing vertex neighbors in an array list
08:41 Learn how to store an undirected and directed graph
10:12 Weighted graphs assign values to edges
11:44 Implementing Graph in Java
Crafted by Merlin AI.

[@nbavideos4487]

Understood! Great explanation

[@gamesensei.8923]

hey striver please make a video on how to participate or the steps required to register in icpc please.

[@oqant0424]

3/56 done (3.12.22)

[@shubhigupta5689]

Understood🌻

[@jitinroy2246]

Notes link in this attached of C++ language, please update it with java language.

[@shauryatomer1058]

understood great explanation

[@farooqshareef3466]

Awesome explanation striver...... Pleass continue this series..... 😌

[@prudhvirajmacherla9854]

understood by slight modification in code the first loop should run less than or equal to n times

[@bubunmukherjee2857]

Can't we use map for weighted graph?

[@jothiprakash7960]

Understood, thanks a lot!

[@RohitKumar-dz8dh]

Understood 😊

[@chandrakantkhannade7326]

understood the whole part! Thank you so much.

[@manojhr9416]

very nice bro.. plz continue full Java DSA

[@devbhojani9274]

can we store the graph in a HashMap instead of an ArrayList? the space complexity will still be the same but Time Complexity will reduce incase we need to access a particular edge...

[@genzScarlet]

Understood!

[@shripadkhandare]

great explanation as always !

[@UECAshutoshKumar]

Thank you sir

[@vakhariyajay2224]

Thank you very much. You are a genius.

[@Sillysmiles76]

Understood, Awsome content, keep going 🙌

[@TheCricketChap]

Great explanation!

[@p38_amankuldeep75]

Thank you very much for these quality content💙💜💙

[@samyakagarwal1777]

great explanation

[@vikasbagri1225]

understood very well...

[@samuelfrank1369]

Thanks a lot. Understood.

[@andresfgalvis2010]

Understood, thanks a lot

[@parshchoradia9909]

Understood SIr!

[@udayrajvadeghar8555]

understood!

[@ShresthaSinha-pr8zv]

m is the no of edges .so why are u assuming three in all cases??

[@dewanandkumar8589]

Understood

[@VinayKumarcs127]

Very nice explanation brother.

[@VinaySharma-pz9tr]

bhai notes hai kya??

[@LoayThePhrygian]

Understood ! What if an edge has no weight in the matrix do we say 0

[@ramyasaichivukula6824]

how do we add the nodes to inner array if we have a graph the has bidirectionak and directional edges?

[@mriduljain6809]

Understood Bhaiya

[@KartikeyTT]

tysm sir

[@_hulk748]

Understood sir🙇‍♂❤🙏

[@akashsahu2571]

at 20:03 you got us

[@devesh819]

Understood day 1

[@user-bc6ss6gp3z]

#Striver rocks 🤟

[@rajivpunjabi4237]

Can we use sets or maps to store the associated nodes? In case of unweighted graphs we can use a Set to maintain the nodes and for weighted graphs we can use a Map where the key could be the node and value will be the weight.
For a graph like
/ 2
1 |
\ 3
Without weight - [Set{}, Set{2,3}, Set{1,3}, Set{1,2}]
With weight - [Map{}, Map{2: X, 3: X}, Map{1: X, 3:X }, Map{1:X, 2:X}]
So you can easily perform lookup's as well. Thanks for the video.

[@arshansari458]

shouldnt the space complexity in adjacency arrayList be n2 as in worstcase there all nodes are connected so we have N+1 lists and size of each is n so n2

[@tejth]

UNDERSTOOD

[@akhil1809]

awesome content bro ... 😍

[@user-ed8bc2hg5o]

understood

[@hrushi_borhade]

understood striver!!

[@rohitmalhotra2566]

Best content as always

[@saritakumari4787]

How to represent graph of Complex objects like employee or people. what will be the datatype for such adjacency list? storing just numbers may not be enough here

[@pagal4621]

first define the class to create object and use
Hashmap mp = ..... ;

[@MrPrakash219]

UNDERSTOOD❤️

[@aj9706]

Excellent

[@amarjeetkumar-hk2jl]

Under stood , but do in need to to fill first adj Matrix with Zero.

[@ratnadeepsaha7675]

I have one question. Can I use the collections framework while writing codes in Online coding ide(s), those are used in Online coding exam round of Product-based or service-based companies?

[@Lyfhaxx]

yeah

[@CodeMode9313]

dada wese app
padate accha ho

[@coolraviraj24]

completed !!!

[@dreamyme543]

Understood:)

[@surya8731]

Complete dp with java also

[@september-jk1ps]

Sir how this graph serious is different from your previous graph series ??

[@farooqshareef3466]

I think that series it was based on popular problems of graph such as shortest paths ....etc.and i think in this series we will learn implementation of graphs and problems on it.... Lets hope good. 🙃

[@maddipatlamadhura1500]

US

[@prajwalbs772]

Bro what about c++

[@prasadm3614]

G2 is on C++

[@ankanhaldar1130]

package Graph;
import java.util.ArrayList;
import java.util.Scanner;
public class graph_representaion {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
System.out.print("Enter the number of vertices: ");
int v=sc.nextInt();
ArrayList adj=new ArrayList();
for(int i=0; i

[@aniketbansod8136]

Please Add code for java coders

[@munendragaur4965]

mast bhai
mera placement hone ke baad mujhe party dena

[@tle964]

You have already uploaded graph series last year
Why are you uploading new again

[@venutalla5932]

understood but no code for java people

[@rayyansyed2998]

"us"

[@naushadalam5129]

but there is no pair in java bhaiya ???

[@himanshushukla7370]

use ArrayLisT, and then push two element at a time

[@swacharahman5084]

undrestood

[@ankurprabhu2547]

Us

[@BTECE_manichandT]

1st comment

[@ManideepNalumachu]

Understood

[@user-ed8bc2hg5o]

understood

[@Sakshi-nd2jz]

Understood!

[@sukhjattana5887]

understood!

[@vivekpawar311]

US

[@himanshidafouty347]

Understood

[@NARUTOUZUMAKI-bk4nx]

Understood

[@premduvvapu476]

Understood

[@karanrao8956]

Understood

[@chiragbansod8252]

understood

[@arsalanmaulvi7170]

understood

[@adarshkumarrao3478]

understood

[@sangeetasharma8574]

understood

[@RJ-bd3ww]

Understood

[@komalkrishna7836]

Understood

[@shrunkhalaraut7789]

Understood

[@sreyanssinghi8583]

Understood

[@shantanubose4972]

Understood

[@KratosProton]

Understood

[@shashank820]

Understood

[@abhijeetkumar2970]

understood

[@akshaypatade5730]

understood