0:00 intro 1:58 graph terminology 5:13 applications of graph 9:20 simple graph 11:36 important property of a simple graph 15:37 neighbors, degree of a node 20:58 representation of a graph 26:33 path in a graph 29:36 model graph problems 32:31 shortest path tree 41:38 computing shortest path in a graph (BFS using level set)
Teaching myself discrete math out of an old textbook and it's crazy how applicable everything is already while watching this. Thanks again MIT for the great content!
Great lecture. I appreciate MIT for rolling out so many informative videos for the last 2 hours. I'd rather binge-watch them than content on Netflix. Thank you.
I wouldn’t say an edge list is the dumbest way to store a graph. It proves to useful in an algorithm like kruskals algo for finding minimum spanning tree
I mean it's an hour long MIT lecture building up to BFS from basic graph theory. There are plenty of other videos that just give you code for BFS if that's what you want
0:00 intro
1:58 graph terminology
5:13 applications of graph
9:20 simple graph
11:36 important property of a simple graph
15:37 neighbors, degree of a node
20:58 representation of a graph
26:33 path in a graph
29:36 model graph problems
32:31 shortest path tree
41:38 computing shortest path in a graph (BFS using level set)
Teaching myself discrete math out of an old textbook and it's crazy how applicable everything is already while watching this. Thanks again MIT for the great content!
Yup that's what I felt as well. Which textbook are you referring to?
@@therealb888 "Discrete Math" by Dossey et al, 2nd edition from 1987
Great lecture. I appreciate MIT for rolling out so many informative videos for the last 2 hours. I'd rather binge-watch them than content on Netflix. Thank you.
It's funny today a coworker asked me if I watched some movie on netflix, I realized I couldnt remember the last time I spent any time there
@@waynet3534 the content is diluting, more and more. Disney's marvel shows have been refreshing but get old after a while.
Phenomenal lecture, demonstrates BFS by gradually building up from simpler ideas
i like how excited he got at the chalk forking... I wish my graduate teacher would have any of this optimism
Lecture skill is improved over that first lecture on sets and sorts, must be getting settled in or just more comfortable with this material.
I just discovered his TH-cam channel, which has lots of lectures that are not on OCW:
th-cam.com/users/justinmsolomonplaylists
Good lecture. More mathematical than most lectures on BFS.
pretty sure it's Erik on 27:14 in blue T-shirt
I wouldn’t say an edge list is the dumbest way to store a graph. It proves to useful in an algorithm like kruskals algo for finding minimum spanning tree
Everything makes sense except the last part form here 45:20
Well, that was a pedagogically genius approach to teaching BFS. 👍
14:44 , i see what you did there......genErikally. Nice :)
Pure gold!
Great lecture! Thank you Justin!
who is the mystical jason
He is sitting next to Erik in the audience
THANK YOU SO MUCH GUYS
I already know BFS and the end of this lecture is still confusing to me. Did he run out of time?
It was a pretty bad performance fro mthe lecturer
Awesome
He looks like Body builder ?
Am I stupid or this teacher makes it so hard
he is not very good
He didn't really cover much of BFS algorithms at all in this lecture, it was more covering Graph Theory definitions
I mean it's an hour long MIT lecture building up to BFS from basic graph theory. There are plenty of other videos that just give you code for BFS if that's what you want
Day 13 present
Title is misleading, only basic stuff
Terrible lecturer, put me right off watching in first few mins
what the fuck is that name
@sumo cum, you are right
@@abdelaziz2788 F** or not F** in that name, that's a good queston.
0:31 that time i got reincarnated as a theoretical computer scientist and I maxed out my knowledge and became mit professor.