Thank you for the visual explanation. Pearson didn't think that was necessary lol. The text read, "Formally, a graph is defined by a pair of two sets: a finite non-empty set V of items called vertices and a set E of pairs of these items called edges. If these pairs of vertices are unordered, i.e., a pair of vertices (u, v) is the same as the pair (v, u), we say that the vertices u and v are adjacent to each other and that they are connected by the undirected edge (u, v).........." Drawing a picture is in computer science is often a much more efficient use of time.
Liked, Subscribed, All Notfication On, and here is the comment. I hope it beats the TH-cam algorithm. This page definitely deserves more than a million subscriber already. Sooner or later it will. So much relevant information in a quick 10-15 mins video 🎰💰, completely hooked and can't wait to binge watch entire Java and DSA playlist this weekend!
I did love it ,Bro Brometheus you r the greatest Bro in the whole history you rock . I wanted to see you make it for while now and you have granted me my wish , really thank you The best Bro of All Eras
my teacher tried to explain this for 50 minutes and I didn't understand this crap and you just took 1.30 minutes to understand nodes and edges. Thank you
I appreciate your work, but you have one mistake. A space complexity O(V+E) is not necessarily smaller than O(V^2) since it is dependent on the number of edges. In the worst case we would have all vertices having edges to other vertices, hence E = V^2. Then both matrix and linked list would have space complexity of O(V^2), even though this is not the case for most of the scenarios it is important to indicate.
Awesome man, this will help me a lot. Btw, if it's not too much to ask, can you do some videos on network programming in java? It is pretty hard and I don't understand anything at my Uni.
I had a simple question What changes do we need to do in the quick sort algorithm you showed so that the array is sorted in descending order? Of course I can reverse an array after sorting in ascending order but it won't be that efficient if I have millions of elements in the array.
making up cross pair of currency exchange rates from limited currency exchange rates pairs from an api , to find smallest paths to find the wanted exchange rate for the new currency pairs
I have a question.I studied Python last summer, now i want to learn C but in school we do homeworks using Java. Should i learn Java only or study both of them?
This vid taught me why squidward is such a jerk. spongebob has many friends and an extended network beyond direct friends. Squidward only has spongebob. Squidward resents spongebob for having what he actually wants- real friendship. This resent is his primary motivation for navigating the sea. Seeing spongebob have everything fuels squidward endlessly in a toxic self-destructive manner. Anyways, what's this graph stuff all about again???
Short, straight to the point and no annoying music. Great content!
"Alright what's going on everybody. Graphs..."
nice
Your explanation makes it as if you're teaching us to butter bread. Appreciate your work😊
Thank you for the visual explanation.
Pearson didn't think that was necessary lol. The text read, "Formally, a graph is defined by a pair of two sets: a finite non-empty set V of items called vertices and a set E of pairs of these items called edges. If these pairs of vertices are unordered, i.e., a pair of vertices (u, v) is the same as the pair (v, u), we say that the vertices u and v are adjacent to each other and that they are connected by the undirected edge (u, v).........."
Drawing a picture is in computer science is often a much more efficient use of time.
Liked, Subscribed, All Notfication On, and here is the comment. I hope it beats the TH-cam algorithm. This page definitely deserves more than a million subscriber already. Sooner or later it will.
So much relevant information in a quick 10-15 mins video 🎰💰, completely hooked and can't wait to binge watch entire Java and DSA playlist this weekend!
You are 💯% true
He will get there for sure!
I JUST STARTED LEARNING THIS IN SCHOOL!! I AM GONNA BE AHEAD OF MY CLASS THANKS TO YOU!! 😁😁😀😀
which country are you from
❤😮
Same
Commenting for the algorithm because this page deserves so much more.
Thank you so much, Bro. You're a great help. It would be too hard for me to understand programming without your videos.
The 'alright!' at the start of the video makes it fun to watch😂😂😂😂. Great Video sir🙏🔥
Great introduction to graphs. Thank you bro.
i wish you will also add practical implementation of these concepts
I did love it ,Bro Brometheus you r the greatest Bro in the whole history you rock . I wanted to see you make it for while now and you have granted me my wish , really thank you The best Bro of All Eras
maaan you are making my DS exam prep soooo much interesting and easy! APPRECIATED !!!!!!
Why have the other videos to this topic been removed?
I learn more from this guy than my school lmfaooo
Thanks 😜 Love from PK🇵🇰
lecture was simply awesome,Easy way to understand with this Presentation.
Thank you. Straight to the point and very good to understand, even with my not so good english.
This is coming up in my programming lll class and then you made a video for it! Thank you always!!
thanks for the simplified explanation. great content!
Truly appreciate your work! #bestBro
Love your Channel!
Maybe an A* demo sometime down the track would be cool!
Awesome, Thanks bro 🔥🔥
You are the best teacher
damn bro, that was quick and simple.
im going to edge to this
my teacher tried to explain this for 50 minutes and I didn't understand this crap and you just took 1.30 minutes to understand nodes and edges. Thank you
I appreciate your work, but you have one mistake. A space complexity O(V+E) is not necessarily smaller than O(V^2) since it is dependent on the number of edges. In the worst case we would have all vertices having edges to other vertices, hence E = V^2. Then both matrix and linked list would have space complexity of O(V^2), even though this is not the case for most of the scenarios it is important to indicate.
thank you. Its a great intro to graphs
Great work here
waiting for full lenthg video ..... thanks bro ................
interesting please lets give us more introductions with codes on this graphs
Appreciate your work
Thank you so much man.Yue're a life saver
hi , very helpfull and clear!!
Please add more dsa topics such as backtracking etc
Just made the video a full 580 instead of a dull 579!!!!
THANKS FOR THE IMPRESSIVE CONTENT BRO!!
Nice class
great...!
this is about c# .Why do you use int by defualt over other whole number data type
thank you Bro ! , this helped me
This guy is a fellow bro.
Awesome man, this will help me a lot.
Btw, if it's not too much to ask, can you do some videos on network programming in java? It is pretty hard and I don't understand anything at my Uni.
I had a simple question
What changes do we need to do in the quick sort algorithm you showed so that the array is sorted in descending order? Of course I can reverse an array after sorting in ascending order but it won't be that efficient if I have millions of elements in the array.
if you have milions of records, you should use merge sort. For the quicksort just switch > with
Sir you have huge knowledge of this
Where did you get this all sir?
Sir what you do for living?
nice
making up cross pair of currency exchange rates from limited currency exchange rates pairs from an api , to find smallest paths to find the wanted exchange rate for the new currency pairs
I have a question.I studied Python last summer, now i want to learn C but in school we do homeworks using Java. Should i learn Java only or study both of them?
hey bro! can you make a rust pl. course?
Wait the adjacency list is a linked list? Interesting i learned it as a dictionary with a array as the value for any edges with the node being the key
It is traditionally taught as a hashmap (linked lists when there are collisions)
Hi Bro, can you do bash tutorial?
She edge on my vertex 'til I graph
Thanks bro :)
sweet
I love it
Thank you!!!
Thanks sir
Thanks!
I love you thank you
THANKS!
You are my Hebro (hero bro)
i love u bro
You could create a vodep on java 8 features
🔥
thanks
make kotlin course
it depends if enough people are interested
@@BroCodez i'm in! i need kotlin for android dev.
could you do it in december? i have my exams soon...
@@BroCodez yep you can send a statistic or choose from youtube do they want or not
@@BroCodez please before moving to any other tutorial please complete this course of dsa
@@sahilsuman3820 yes
This vid taught me why squidward is such a jerk. spongebob has many friends and an extended network beyond direct friends. Squidward only has spongebob. Squidward resents spongebob for having what he actually wants- real friendship. This resent is his primary motivation for navigating the sea. Seeing spongebob have everything fuels squidward endlessly in a toxic self-destructive manner. Anyways, what's this graph stuff all about again???
Oh dear, a system error has caused the transaction to wander off to an invalid email address.
Thank you so much, bro... greetings from ecuador (south america just in case you don't know where this corrupted country is.... lol)
I found this 🔥
Hey man, good, what about you.
Do a face reveal
Shea Center
comment for algo
Bahringer Stream
first
nice
:((
:))
306 Barton Parkway
Thanks Bro!!