Graph Representation in Java

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

---------------------------------------------------------------------------------------------------------------------------------------------------- Pr-Requisites: Previous video of Graph Series
Watch at 1.25x for best experience.

-------------------------------------------------------------------------------------------------------------------------------------------------
Java code Link:

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

-----------------------------------------------------------------------------------------------------------------------------------------------------
You can use "TAKEUFORWARD10" coupon code while checkout...

Follow them on social media for all updates:
---------------------------------------------------------------------------------------------------------------------------------------------------

#dsa​ #striversgraphchallenge​ #placements

[suwin]

Timestamp

00:00 Graph Input : n m weight
u v 1 (if weight is not given)
n = number of nodes
m = number of edges

01:57 Adjacency Matrix : Check whether the graph is 1 based indexing or 0 based indexing
For 1 based indexing, create a n+1 x n+1 matrix
Disadvantages : if n within range of 10^5, n x n = memory limit exceded.
03:47 Adjacency Matrix : Java Code - general representation
int adj [ ] [ ] = new int [n+1] [n+1];
adj [u] [v] = 1;
adj [v] [u] = 1;
06:45 Adjacency List : Concept
ArrayList<ArrayList<Integer>> adj = new
08:42 Space Complexity : Undirected graph - O(n + 2*e)
Directed graph - O(n + e)
n = number of nodes
e = number of edges
08:47 Adjacency List : Java Code
General representation
adj.get(u).add(v)
adj.get(v).add(u)
10:25 If edge weight given, store pair of integer

[channelname]

Best explanation. understood, hope this channel reaches more people

[tannukumari]

Learning java by watching your videos, after watching c++ implementation😁

[ashokdurunde]

Thank you so much, sir, if possible can you make a series with such depth for Trees as well?

[laveshchanchawat]

Bro can you please share the notes or book from where we can revise

[Ryan-mrpn]

what should we generally use for adjacency list in graphs?! ArrayList or LinkedList

[cinime]

Understood! Thank you very much as always!!

[rohandevaki]

every lecture i visit in this channel has promotion

[priyashukla]

How can we add weight, as you said pair of integers so should we have to use a map there as a key value?

[devanshuanand]

can we use a combination of maps and list to store graphs if yes then how ?....will it be better than vectors and arrays?

[tejaswigutta]

can somebody please explain how the space complexity is n+2e for adjacency list representation of undirected graph

[rohandevaki]

you didnt take the inputs from the user in main, you just initialised it.

[anuraggoswami]

Understood everything clearly but cat imagine the array list in arraylist 😢