Hello bhaiya love ❤ from IIT Guwahati a freshman . after completing c language in college i started watching your dsa course your lacture is the best lacture in TH-cam 😊.. i promise you that i will complete ✅ your full dsa course ..❤# coder army
there can be thousand of tutor and thousand of video on youtube but the way rohit bhiaya is teaching CONCEPT CHAMAK RHA H ajtak adjacency list smjh nhi aya tha lekin ab sb sort h thank you bhaiya
Bhaiya ek suggestion hai … jaisa aap pahle direct code editor pe likhne ke pahle board pe code likhte teh … waise hi graph. Ke questions main karna …. Jho new pattern ka question ho ya new concept ho .. unka code pahle board pe likhwa kar samjhana .. phir editor pe
What's this 60 days of code ? Is it that bhaiya will have 60 lectures of Graph, or is it that in these 60 days, everything left to be covered for DSA will be done, or something else ? Please do let me know.
"Thank you so much bhaiya for creating this informative video on graph adjacency matrix and adjacency list! Your clear explanations and examples have helped me understand these concepts better. Keep up the great work, looking forward to more educational content from you!"
#Day 02/60 #60DaysOfDSA #RohitBhaiya Waiting for lecture could't see but when refreshed page i got it at 6:06 A.M. I think htere must be a reason when you wake up and nowadays it's you bhaiya and team. May the good you do return to you in hundredfolds.
Completed Day 2 along with homework. Best part nhi hota bhaiya, puri video hi best hoti hai 😊😊. // Adjacency List (Directed UnWeighted Graph) #include using namespace std; int main(){ int vertex, edges; cin>>vertex>>edges; vectorAdjList[vertex]; int u,v; for(int i=0; i>u>>v; AdjList[u].push_back(v); } for(int i=0; i
I see you are also watching his videos in a continuous manner in mere aas paas he ho let's have a challenge harr din k end Tak kon zayda aage hoga ek doosre video number k comparatively like maine last video jo dekho ho agr woh tum se zayda then I m Better and vice versa :)
@@chanchalsoni7535 jo bhi video main dekh lunga uss pe comment kr doonga like reached till here or something and tum bhi same krna uss se hum dono ko pata rahega humara opponent konsi video pe hai and isi bahane bhaiyyya k comments bhi badh jaayenge so next time when you are on a video look for my comment :)
@@chanchalsoni7535 main jo video dekhunga uss k end pe comment kr doonga reached till here or something like that and tum bhi aisa he kuch kr dena iss he hum dono ko pata rahega ki humara opponent humm se kitna aage ya peeche hai isi bahane bhaiyya k comments bhi badh jaayenge
Coder army saare dsa courses ka Baap Mtlb baap bhi nahi daddu of all dsa course that available on TH-cam wheather it is free or paid. Rohit bhai love from Uttarakhand ❤️❤️
bhaiya plz do it like that, jaisa aap pahle direct code editor pe likhne ke pahle board pe code likhte the ,waise hi graph. Ke questions main karna, jo new pattern ka question ho ya new concept ho, unka code pahle board pe likhwa kar samjhana, phir editor pe.
00:05 Understanding graph representation using data structures 01:01 Difference between Adjacency Matrix and Adjacency List 03:08 Understanding adjacency matrix and its representation 04:03 Graph representation using adjacency matrix and list 06:26 Graph representation using adjacency matrix 07:14 Creating graph diagrams is a simple task 09:00 Representing a graph using a 2D array in a simple manner 09:56 Understanding weighted and unweighted graphs 12:03 Zero in graph representation signifies absence of edges and weight 12:56 Understanding graph representation through directed edges 14:57 Graph representation using edge values 15:59 Graph Representation using Adjacency Matrix and Adjacency List 17:42 Creating Adjacency Matrix for Undirected, Unweighted Graph 18:33 Creating adjacency matrix in data structure 20:38 Graph representation using weighted edges 21:26 Understanding graph representation using adjacency matrix and list. 23:15 Creating matrix representation of graph using input values 24:02 Understanding directed weighted graphs and its implications. 26:04 Understanding graph edges through adjacency matrix and adjacency list 26:57 Graph Representation using Adjacency Matrix and List 28:24 Representation of Graph using List or Vector 29:04 Introduction to adjacency list and vector representation 30:46 Implementing graph representation using adjacency list 31:57 Introduction to graph representation in data structures 33:47 Storing and manipulating data in a case of zero and one edge 34:44 Understanding graph representation through adjacency matrix and list 36:31 Graph representation using adjacency matrix and adjacency list. 37:34 Understanding Complete Graphs through Vertex and Edge concepts 39:13 Creation of Adjacency List in Data Structure 40:13 Printing the adjacency list for each vertex 42:14 Unweighted graphs vs. weighted graphs 43:01 Understanding pair creation and weight calculations 45:15 Understanding representation of graphs using adjacency matrix and adjacency list 45:59 Comparison between Adjacency Matrix and Adjacency List 47:59 Graph representation using adjacency matrix and adjacency list explained. 48:48 Understanding the concept of adjacency in graph 50:32 Dense graphs have high number of edges, sparse graphs have low number of edges 51:27 Graph prefers sparse over dense graph 53:09 Understanding the space complexity of using graph representation 53:50 Preference for adjacency list due to space efficiency 55:38 Graphs contain vertices and edges 56:44 Understanding the concept of root node in graph representation 58:32 Graph representation using adjacency matrix and adjacency list 59:47 Understanding vertex degrees in graph representation 1:01:16 Graphs can be trees but not every tree is a graph 1:02:04 Efficiently solving coding problems using concepts
Directed Weighted Adjaacency List #include #include using namespace std; int main(int argc, char const *argv[]) { int vertex, edges; cin >> vertex >> edges; vector AdjList(vertex); int u, v, weight; for(int i = 0; i < edges; i++) { cin >> u >> v >> weight; AdjList[u].push_back(make_pair(v, weight)); } for(int i = 0; i < vertex; i++) { cout
v=bhaiya rbr sir ka lectures dekh rha hoon gate ke liye bhaiya jo sir pdf diye hai ushi ko solve krna hai nah sir please guide for gate little bit bhaiya plzz
Hello bhaiya love ❤ from IIT Guwahati a freshman . after completing c language in college i started watching your dsa course your lacture is the best lacture in TH-cam 😊.. i promise you that i will complete ✅ your full dsa course ..❤# coder army
Tghhuyudffgyhhj
the best channel to learn DSA for beginners
i have no word to express your way of teaching in which you are delivering the complex concept in easy manner................
vector adjlist[vertex]; this is a array of size vertex which stores the datatype of vector
there can be thousand of tutor and thousand of video on youtube but the way rohit bhiaya is teaching CONCEPT CHAMAK RHA H ajtak adjacency list smjh nhi aya tha lekin ab sb sort h
thank you bhaiya
Bhaiya ek suggestion hai … jaisa aap pahle direct code editor pe likhne ke pahle board pe code likhte teh … waise hi graph. Ke questions main karna …. Jho new pattern ka question ho ya new concept ho .. unka code pahle board pe likhwa kar samjhana .. phir editor pe
Yeah, that was better
Exactly 😊.
Ya bro u r right
Best part 11 minute mein problem solve.. really salute to rohit bhai...
Maja aa gya bhaiya (best part understanding the concept of adjacency list vs adjacency graph)☺☺
representation of graph crystal clear ✅✅ best part for me is the example of Facebook
Day - 02/60 #60DaysOfCode
What's this 60 days of code ?
Is it that bhaiya will have 60 lectures of Graph, or is it that in these 60 days, everything left to be covered for DSA will be done, or something else ?
Please do let me know.
@@anshuraj5734 Remaining topics will cover in 60 days and then the DSA series will complete.
I like the way you explain the concept with real world examples. Keep it up Bhaiya 🔥
lage rho bhaiya 💪...best explanation.. understanding all concepts
Sir ji kuch khas hai ❣️ sir bs plz jaldi complete krwadijiye apse padhata hu to samjh ata hai 🤓 you are the best best bhaia 🔥
Adjacency list and Adjacency Matrix Chamak Gaya...🚀🔥
"Thank you so much bhaiya for creating this informative video on graph adjacency matrix and adjacency list! Your clear explanations and examples have helped me understand these concepts better. Keep up the great work, looking forward to more educational content from you!"
Love from Mirzapur bhaiya jii ❤❤ aap kya concept clear krte h . Mai abb khud se solution bna pa rha huu. Thanks bhaiya jii 🙏🙏
best lecture of whole youtube.
Jai shree Ram ❤️
Ek dum Gold 🥇🪙 content
Rohit bhai OP
#GRAPH OP i think this will be the G.O.A.T of all graph series
#Day 02/60 #60DaysOfDSA #RohitBhaiya
Waiting for lecture could't see but when refreshed page i got it at 6:06 A.M.
I think htere must be a reason when you wake up and nowadays it's you bhaiya and team.
May the good you do return to you in hundredfolds.
complete video is knowledgeable but how to find spam user this is the best part of video for me
You are a sheer genious at explaining the concepts of DSA bhaiya❤
Graph ko bhi aap halwa bana doge hamare liye.
Directed Weighted Code.
#include
#include
using namespace std;
int main(int argc, char const *argv[])
{
int vertex,edges;
cin>>vertex>>edges;
vectorAdjMat(vertex,vector(vertex,0));
int u,v,weight;
for(int i=0;i>u>>v>>weight;
AdjMat[u][v]=weight;
};
for(int i=0;i
Next level explanation 😍
Thank you bhaiya 🫶
Whole video is best part 🤘
you way of explaination is very good sir ☺☺☺
Day 2/60 ✅. Bhaiya please... explain the code a little in board before moving on directly to the code editor as you used to do before.
Completed Day 2 along with homework. Best part nhi hota bhaiya, puri video hi best hoti hai 😊😊.
// Adjacency List (Directed UnWeighted Graph)
#include
using namespace std;
int main(){
int vertex, edges;
cin>>vertex>>edges;
vectorAdjList[vertex];
int u,v;
for(int i=0; i>u>>v;
AdjList[u].push_back(v);
}
for(int i=0; i
Ab to pw army ke badle coder army name kar do
Baap Level Content 🔥🔥🔥
what an amazing teacher
excellent cementing on build blocks of graph.
incredible lecture bhaiya.
this man is real life...G.O.A.T.....lots of love❣
I see you are also watching his videos in a continuous manner in mere aas paas he ho let's have a challenge harr din k end Tak kon zayda aage hoga ek doosre video number k comparatively like maine last video jo dekho ho agr woh tum se zayda then I m Better and vice versa :)
@@rocketgamerzz.7577 😂😂okay
@@chanchalsoni7535 yooo less goo
@@chanchalsoni7535 jo bhi video main dekh lunga uss pe comment kr doonga like reached till here or something and tum bhi same krna uss se hum dono ko pata rahega humara opponent konsi video pe hai and isi bahane bhaiyyya k comments bhi badh jaayenge
so next time when you are on a video look for my comment :)
@@chanchalsoni7535 main jo video dekhunga uss k end pe comment kr doonga reached till here or something like that and tum bhi aisa he kuch kr dena iss he hum dono ko pata rahega ki humara opponent humm se kitna aage ya peeche hai isi bahane bhaiyya k comments bhi badh jaayenge
Thanks bhaiya ab word hi khatam ho gaye apki tarif me 😊
Day 2 completed
Thank you bhaiya
you are amazing
The whole part of the video was best bhaiya
Thanks bhaiya your consistency is my consistency ❤
best part:- real life use cases of graph
Chamak Gaya bhaiyaa ❤
Graph++
2/60🎯
Thankyou bhabhi😇
next level concept.
Day 2 Done ✅
Chamak Gya Bhaiya
❤ Now I know how fb finds spam accounts. So insightful.
whole lec is best
bhaiya ❤ ek no. padha rhe ho aap but ek approximate bata do kab tak complete ho jayega DSa course ?🙏
Best Part to whole video tha but if emphasised then , adjlist vs Adjmatrix
Adjacency Matric Chamak Gaya Bhaiya...💪🚀🙏
Coder army saare dsa courses ka Baap Mtlb baap bhi nahi daddu of all dsa course that available on TH-cam wheather it is free or paid. Rohit bhai love from Uttarakhand ❤️❤️
best part ; whole video
rohit bhai ek suggestion hai ki focus on pseudo code more so that it will be easy for all the language students
Best part is to use real world cases
bhaiya plz do it like that, jaisa aap pahle direct code editor pe likhne ke pahle board pe code likhte the ,waise hi graph. Ke questions main karna, jo new pattern ka question ho ya new concept ho, unka code pahle board pe likhwa kar samjhana, phir editor pe.
Can you please 🥺 make such a kind of series in machine learning bhaiya? Then it will be very very helpful for us.
Day 2 complete
Videos best part is adjacency list representation
gud mrng bhaiya, keep it up!
how can we implement it by classes?
Chamk gaya bhaiya graph++
Day 2/60✅
bhaiya aapki watch konsi hai ??
00:05 Understanding graph representation using data structures
01:01 Difference between Adjacency Matrix and Adjacency List
03:08 Understanding adjacency matrix and its representation
04:03 Graph representation using adjacency matrix and list
06:26 Graph representation using adjacency matrix
07:14 Creating graph diagrams is a simple task
09:00 Representing a graph using a 2D array in a simple manner
09:56 Understanding weighted and unweighted graphs
12:03 Zero in graph representation signifies absence of edges and weight
12:56 Understanding graph representation through directed edges
14:57 Graph representation using edge values
15:59 Graph Representation using Adjacency Matrix and Adjacency List
17:42 Creating Adjacency Matrix for Undirected, Unweighted Graph
18:33 Creating adjacency matrix in data structure
20:38 Graph representation using weighted edges
21:26 Understanding graph representation using adjacency matrix and list.
23:15 Creating matrix representation of graph using input values
24:02 Understanding directed weighted graphs and its implications.
26:04 Understanding graph edges through adjacency matrix and adjacency list
26:57 Graph Representation using Adjacency Matrix and List
28:24 Representation of Graph using List or Vector
29:04 Introduction to adjacency list and vector representation
30:46 Implementing graph representation using adjacency list
31:57 Introduction to graph representation in data structures
33:47 Storing and manipulating data in a case of zero and one edge
34:44 Understanding graph representation through adjacency matrix and list
36:31 Graph representation using adjacency matrix and adjacency list.
37:34 Understanding Complete Graphs through Vertex and Edge concepts
39:13 Creation of Adjacency List in Data Structure
40:13 Printing the adjacency list for each vertex
42:14 Unweighted graphs vs. weighted graphs
43:01 Understanding pair creation and weight calculations
45:15 Understanding representation of graphs using adjacency matrix and adjacency list
45:59 Comparison between Adjacency Matrix and Adjacency List
47:59 Graph representation using adjacency matrix and adjacency list explained.
48:48 Understanding the concept of adjacency in graph
50:32 Dense graphs have high number of edges, sparse graphs have low number of edges
51:27 Graph prefers sparse over dense graph
53:09 Understanding the space complexity of using graph representation
53:50 Preference for adjacency list due to space efficiency
55:38 Graphs contain vertices and edges
56:44 Understanding the concept of root node in graph representation
58:32 Graph representation using adjacency matrix and adjacency list
59:47 Understanding vertex degrees in graph representation
1:01:16 Graphs can be trees but not every tree is a graph
1:02:04 Efficiently solving coding problems using concepts
Thank you sir
explanation was good but sparse or dense mee thoda confusion hea👌❤
Attendance 👍🏻
Ram ram bahi❤
Day 2 Completed ❤
Can anyone post the java code for weighted graph using ArrayList ?
Ram ram bhaiya achhe se chamak gya
Day - 02/60 #60DaysOfCode
Bhaiya maja aa gya aapse padkar
FOR ADJACENT LIST
#include
#include
using namespace std;
int main()
{
int vertex, edges;
cin >> vertex >> edges;
// UNDIRECTED UNWEIGHTED
// vector Adjc[vertex];
// UNDIRECTED WEIGHTED
// vector Adjc[vertex];
// DIRECTED UNWEIGHTED
vector Adjc[vertex];
// DIRECTED WEIGHTED
// vector Adjc[vertex];
int u, v;
// int weight;
for (int i = 0; i < edges; i++)
{
// cin >> u >> v >> weight; // Weighted
cin >> u >> v;
// Adjc[u].push_back(make_pair(v, weight));
// Adjc[v].push_back(make_pair(u, weight));
Adjc[u].push_back(v);
// Adjc[u][v] = weight;
// Adjc[v][u] = weight;
}
for (int i = 0; i < vertex; i++)
{
cout
First Like👍, then Watch.💻
thanks bhaiya..
Mast Chamak gaya hai bhaiya. Bhaiya, I want your mentorship. Could You help me?
Day2/60 completed
comparision and understanding of representaion of graph++
Bhaiya Radhe Radhe 🙏
Good morning bhaiya ji❤
Thank youuuuuuuuuu Bhaiya🥺❤️
I like this dsa
Good Morning Bhaiya Ji.
Good morning bhaiya ❤
Thanks Bhaiya...✅💯
Thank you bhaiya love you.
Thank you very much
My day 1 of 60 days of dsa .
Jai hind bhaiya ❤
day 2 of graph..!!
Understood.
Day 2/Day60 done
❤❤❤❤
chamak gaya
bass pen ki ink khatm no ho aapki🤣🤣😜😜
sir please prims and kruskal algorithm
Abhi koe programming language nhi aata hai to phle C++ padhe ki DSA ??
Directed Weighted Adjaacency List
#include
#include
using namespace std;
int main(int argc, char const *argv[]) {
int vertex, edges;
cin >> vertex >> edges;
vector AdjList(vertex);
int u, v, weight;
for(int i = 0; i < edges; i++) {
cin >> u >> v >> weight;
AdjList[u].push_back(make_pair(v, weight));
}
for(int i = 0; i < vertex; i++) {
cout
OP 🔥
Day - 02/60 #60DaysOfCode
DSA++
Day 2/60 Completed ✅
v=bhaiya rbr sir ka lectures dekh rha hoon gate ke liye bhaiya jo sir pdf diye hai ushi ko solve krna hai nah sir please guide for gate little bit bhaiya plzz
best part is those 11 min me prblem solve
#chamakgaya++