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

In case you are thinking to buy courses, please check below:

---------------------------------------------------------------------------------------------------------------------------

[takeUforward]

Lets continue the habit of commenting “understood” if you got the entire video.

Do follow me at Instagram: striver_79

[CodeMode]

@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<n whereas it should be i<=n otherwise we wont be able to access the edges at vertex at n

[ExpoDev_Dash]

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.

[frustrato]

Sir there has been a typo in your video
to print all the edges the first for loop shall have i <= n and not i < n.

[rajatmehta]

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

[rana]

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

[adrianagaraychavez]

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!!

[VikasBagri-ij]

@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?

[hemanthkumar]

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

[suheabkhan]

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

[farooqshareef]

Awesome explanation Pleass continue this 😌

[Sillysmiles]

Understood, Awsome content, keep going 🙌

[PCCOERCoder]

Lecture successfully completed on 02/12/2024 🔥🔥

[p_amankuldeep]

Thank you very much for these quality content💙💜💙

[AdiCode_Hub]

but every node has 2 different weights assosiated with it with diferent edges. SO at 12:30 it looks like confusing.

[chandrakantkhannade]

understood the whole part! Thank you so much.

[manojhr]

very nice bro.. plz continue full Java DSA

[vakhariyajay]

Thank you very much. You are a genius.

[gamesensei.]

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