Meanwhile during Last 5 sec after hearing this gentle request I subscribed cause this the right and best way to ask 👍
@arpit50355 жыл бұрын
best explanation , i just saw this video randomly without having knowledge of graph , still i got everything
@belaluddin65544 жыл бұрын
slowly and best explanation i have ever seen ! this chanel helps me enough to learn as a beginner.
@Chsatyanarayana5 жыл бұрын
In every lecture there is a knowledge on tree which gives us boon for students teachers engineers and everybody. thank u sir.
@04nikunj6 жыл бұрын
problem in audio start 04:58 for minute or so
@shikharbansal29424 жыл бұрын
Your Explanation is simply the best !!
@sudhanshuraina17295 жыл бұрын
*sir you are really doing good, keep it up, and please make videos on competitive programming questions of codechef and codeforces, choose some good questions for interview and contests and please explain them*
@joycethomas62344 жыл бұрын
don't you think that is a it too much ?
@pragatikumari3063 жыл бұрын
Your channel are pure gold 🔥
@yogeshkumarkhare28683 жыл бұрын
very great teaching sir, I am learning very easily
@AbhiKumar-yk9sr Жыл бұрын
You are great teacher sir
@rg94684 жыл бұрын
Such a really good explanation ,this is too good sir.
@jakubg38535 жыл бұрын
realy clearly well done i was trying to understand adjancy list and only after your video im total knowing how it works :D
@anilsuyal3 жыл бұрын
thankyou so much sir, it was the best and easy explanation as i found this video after a lot.
@bestmomentsofgamer21303 жыл бұрын
Hey bro, i dont understand for loop at it=! Graph{i}.end() Can you explain with english because i dont know a lot accent of him
@anilsuyal3 жыл бұрын
@@bestmomentsofgamer2130 Hi bro, see here in a graph array instead of number we're storing a list or vector that will keep track of all the adjacent vertices of a particular vertex. so while printing that graph we're traversing our graph array and for each index that contains a vector we are checking whether that vector ends or not?? i hope you got this, if not just watch that video carefully twice you'll get it.
@vishnu_bhatt6 жыл бұрын
simple and elegant way to teach.Thank you bro
@balavamsi72275 жыл бұрын
how can i implement for character as input , although i declare char u,char v in add edge function icannot use graph[u].pushback(v) because u isnot a integer
@AbhiKumar-yk9sr Жыл бұрын
Aapke jaisa youtuber pe koi explain krke nhi batate h
@asmashaikh35854 жыл бұрын
Hi Vivek I have dought here we are using vertices 0 1 2 3 4 but if we have other values for vertices e.g A, B , C or 10 15 20 in this case our total vertices are 3 only so array start with 0 till 3 so if we try to add vertices directly at the index then we will get AIOOB exception in java so, please clear this.
@rakeshpandey97306 жыл бұрын
awsome way of teaching ..!!
@harshitsaini78794 жыл бұрын
great explanation sir
@akm12374 жыл бұрын
can we just use a double vector instead?
@preetamvarun92194 жыл бұрын
I just got the best start for graphs thank you
@arindamsarkar71225 жыл бұрын
Awesome sir
@rahulshetty38492 жыл бұрын
Thank you sir👍
@RahulKumar-tg5zb4 жыл бұрын
Can we use vector graph(n).
@sumantdhiman58684 жыл бұрын
Yes
@ridimamittal40644 жыл бұрын
you are really doing good, keep it up, and please make videos!!!!!!!
@shouvikdutta28255 жыл бұрын
I guess that will be outside the inner for loop. Am I correct? Someone clear it.
@kummariraju87343 жыл бұрын
Yes
@vipulchandu74345 жыл бұрын
But function addedge has 3parameters but call has only two arguments how it is possie
@shashankfuley64554 жыл бұрын
Keep i up...
@anantpawar74704 жыл бұрын
u r gr8 sir
@adityakothari73804 жыл бұрын
are these not in java ??
@mandar.vaidya4 жыл бұрын
Pls prepare one without STL also
@doniafadil831411 ай бұрын
We want fast integer multiplication please
@suvarnamorabad92635 жыл бұрын
Super Sir. But please explain hypergraph
@ashishmehtaofficial236 жыл бұрын
Sir plz upload graph interview questions video as soon as possible.. thank you
@vikasvishwakarma52636 жыл бұрын
Love u sirjii😎😎😎
@kape101_5 жыл бұрын
i love your vids.
@ankurkumarupadhayay43046 жыл бұрын
find the cycle of directed and also undirected graph .....
@agaqul63714 жыл бұрын
12.52 Instead of Zero it should be One
@gauravkumarsingh14925 жыл бұрын
Sir take a lecture on hashing
@Gaurav-bv6xr6 жыл бұрын
you are great
@bestmomentsofgamer21303 жыл бұрын
Someone can explain for loop at It=! graph{i}.end()
@madanjeetkumar11086 жыл бұрын
sir please upload the explaination of prim' s,kruskal,dijisktra code