Wonderful stuff, I just started watching and plan to go through all these. Your presentation style is wonderful. Kudos to you, and thank you sincerely for sharing.
Extremely good job of explaining! Some people are gifted at teaching! (I know it's not a "gift" it's the result of mainly hard work of looking at problems a zillion times from different perspectives and finding a suitable one to tell the new comer)
Hello William you said a tree is an undirected graph how is that true because in a tree we cannot go to the parent from the child and only move from the parent towards the children, isn't it?
Hi William i'm Claudio from Italy: first of alla compliment for your video (i bought your course on Udemy!)... i'd like to know if exist a software to play with graph theory. I tried Mathematica 13 but, at example for spanning tree uses some proprietary algorithm... thx
to be honest, I understand what you're teaching, but still I have problem in implementing it in java, huhuhuhuhuhuhuhu, any tips on how to implement it? like step-by step video or similar like this
Hey, I usually provide *both* pseudo-code (in Python-Java-ish syntax) AND source code (in Java). What I recommend is watching the video with pseudo-code first, attempting to write your own source code, and then checking out the source code video which usually follows.
How would we represent the graph if there were no weights, but we wanted to use an adjacency matrix? would the weights be 1 or 0? P.S. your videos are amazing
You're talking about an unweighted graph, in such a case you can use an adjacency list and only keep track of from what node to what node an edge is going to (no need to track edge weight)
@@WilliamFiset-videos Ah, alright. So if I wanted to keep track of the properties of the nodes, like let's say I created a node object that had 2 attributes that store height and the width, would I just hash the object into the list?
It looks like the graph theory playlist has been reuploaded by @freeCodeCamp. The description on their video does contain a link to the original playlist but it's not clear if they got permission to clone the playlist to their channel.
mathematically simple graphs are a set of nodes and a set of sets of 2 of those nodes, representing edges. since a set must contain distinct elements you can't have a node link back to itself since it would be the set {A, A} = {A} and only contain one element en.wikipedia.org/wiki/Graph_(discrete_mathematics)
Can you also represent a directed graph as a binary search tree or linked list, I mean that the nodes are actual objects in the dynamic memory, with pointers going to other nodes. class Node { int data; vector edges; };
Hello William, I am an ardent fan of your work. Keep up the good work. While going through your Graph playlist I didn’t find your videos on Bridges and Articulation point. Have you taken them down ?
Came looking for copper, found gold!
Wonderful stuff, I just started watching and plan to go through all these. Your presentation style is wonderful. Kudos to you, and thank you sincerely for sharing.
I am so grateful that Icame across this channel. All of this information is free. Huge thanks and BIG LIKE for you.
I have been watching this playlist since two days constantly. Amazing work!
Extremely good job of explaining! Some people are gifted at teaching! (I know it's not a "gift" it's the result of mainly hard work of looking at problems a zillion times from different perspectives and finding a suitable one to tell the new comer)
This is fantastic! So far the best graph theory series explain I have ever read,
can't believe you are doing all these for free. Thank you
Thank you for the time you spend on these videos, got my final university algorithms exam next week and you've been a great help!
Hope u did well
Your videos are relics.
Thank you so much for share them with us.
Oh my god, i have finnaly found you
Thank you so much for this amazing content.
Your videos are a god send - thank you so much for your contribution!
This guy is a GENIUS
Hello William you said a tree is an undirected graph how is that true because in a tree we cannot go to the parent from the child and only move from the parent towards the children, isn't it?
Check out the tree lectures. Not all trees are rooted trees. Tree Algorithms: th-cam.com/play/PLDV1Zeh2NRsDfGc8rbQ0_58oEZQVtvoIc.html
Great video!
You are amazing!!!! Thank you 🙏🏼
These videos are awesome 😇😇
what is the font you are using
I really appreciate what you are doing.I have been looking for graph algorithms.I just want to ask if you will cover network algorithms ?
Thanks.
rohit kumar Can you give an example of a "network" algorithm? Are you referring to network flow algorithms in general?
sorry I mean to say the same.
Yes! We'll be doing lots of Network flow. It's a large topic but I've scoped out the most important bits I want to cover
Thanks again.
Potential list of topics for Network flow are:
- Ford-Fulkerson
- Edmonds Karp
- Dinics/Hopcroft
- Edmonds Blossom algorithm for max matching
- Mincut
- Applications of network flow
- Duality relationship (linear program)
- Bipartite graph verification
- Push-relabel flow
- Min cost max flow
Could you make a video on Red Black Trees and its implementation? You're the only person who can save me at this point.
You sound like 3Blue1Brown TH-camr! I Like your voice!
Hi William i'm Claudio from Italy: first of alla compliment for your video (i bought your course on Udemy!)... i'd like to know if exist a software to play with graph theory. I tried Mathematica 13 but, at example for spanning tree uses some proprietary algorithm... thx
Thank you!
to be honest, I understand what you're teaching, but still I have problem in implementing it in java, huhuhuhuhuhuhuhu, any tips on how to implement it? like step-by step video or similar like this
Hey, I usually provide *both* pseudo-code (in Python-Java-ish syntax) AND source code (in Java). What I recommend is watching the video with pseudo-code first, attempting to write your own source code, and then checking out the source code video which usually follows.
alright then, I'll try, thank you for replying
isn't a list simpler than an adjacency matrix?
How would we represent the graph if there were no weights, but we wanted to use an adjacency matrix? would the weights be 1 or 0?
P.S. your videos are amazing
You're talking about an unweighted graph, in such a case you can use an adjacency list and only keep track of from what node to what node an edge is going to (no need to track edge weight)
@@WilliamFiset-videos Ah, alright. So if I wanted to keep track of the properties of the nodes, like let's say I created a node object that had 2 attributes that store height and the width, would I just hash the object into the list?
Yes, hello, I am person F...
u sound like penguinz0 😭
you do not have a heavy indian accent and knows how to edit... YOU DO NOT HAVE INDIAN ACCENT AND KNOWS HOW TO EDIT!!!!!! I CAN ACTUALLY LEARN!?
I click dislikes just because there was no any
This series on Graph Theory is amazing! Great job with the presentation, you nailed it!
It looks like the graph theory playlist has been reuploaded by @freeCodeCamp. The description on their video does contain a link to the original playlist but it's not clear if they got permission to clone the playlist to their channel.
Hi James, it's ok, @freeCodeCamp reached out to me and asked for my permission before re-uploading :)
3:52 Can we get an F
8:25 I was wondering, if the graph allows self loops, can it be defined as complete? And if so, does each node require a loop for that?
mathematically simple graphs are a set of nodes and a set of sets of 2 of those nodes, representing edges. since a set must contain distinct elements you can't have a node link back to itself since it would be the set {A, A} = {A} and only contain one element
en.wikipedia.org/wiki/Graph_(discrete_mathematics)
Great Work on Playlists @WilliamFiset! Absolutely Fantastic Exposure :) . I had gone through couple of videos and felt, what was I doing for so long?
sir , please post more video on graphs(regrading on ACM_ICPC)
Best channel for graph algorithm on youtube !
omg he is a sde at google maps and he is teaching graph theory if you are watching graph from someone else you are screwing up
What an introduction, a gem of a channel indeed!
Sir plz tell vertices and nodes are same
I feel like an Idiot
Can you also represent a directed graph as a binary search tree or linked list, I mean that the nodes are actual objects in the dynamic memory, with pointers going to other nodes.
class Node {
int data;
vector edges;
};
Really like these. I am a Sophomore but had some trouble with practice problems because I hadn't read up on any of this theory.
This is probably the best series on graph theory.. Thank you very much
Sir you are really awesome.thanks for such an amazing videos..
The slides (along with video) are awesome Do we have slides for Sorting Algorithm -Insertion , Bubble, Selection ,Merge
Awesome ! The best graph explanation than i have seen ! Great job!
I love to watch your videos :) Thanks!
Amazing videos, thank you.
This is the first video I found on YT with 0 down votes.
Unbelievable content for free !
wtf this channel is amazing. thank you for all the work you put into it!
The effort he puts in content creation !! Hats off boss
Thank you legend
Awesome
Binging has just begun!
Great explanation!
02:16 Seems like it's me.
Hello William,
I am an ardent fan of your work. Keep up the good work.
While going through your Graph playlist I didn’t find your videos on Bridges and Articulation point. Have you taken them down
?
Yes, hopefully just temporarily. There are some issues in the animations that cause confusion
Thank you, William.
what software you are using for making these presentations?
No idea. But you can use Inkscape which is a free open-source for graphic works. There are more than enough tools to make your slides or thumbnails.