00:01
All right, we want to draw an adjacent graph from the adjacency matrix an adjacency matrix has the vertices for the rows and for the columns.
00:12
So one two, three, four five we'll go with a a b doesn't matter where you put them and a circle is the easiest one two, three, four five e are right and then it tells you how many times to connect them so if we're going down a we got zero one three zero four so that means from a to b.
00:35
There is one edge from a to c, there's three and from a to d nothing from a to e for three four b b to a of course, there's one b to b.
00:55
There's two so just make some self loops there.
00:58
There you go b to c is one b to d is three this is starting to look pretty ugly, but you know all right, c c to a c to b c to c is one c to d is zero c to e is one d of course, we don't have to do a b c d to d is zero d to e is two and then e we just want to do e to e which is three of them.
01:35
So one two three self loops kind of ugly, but that's what it is.
01:42
That's an adjacency matrix now, i'm gonna erase that so pause it if you need to and then erase it for the other problem which one's an incident matrix? so you put the vertices on one way? abcde abcde and you put the edges hmm the other way i'll be interesting one, two, three, four, five six, seven, eight nine ten.
02:20
Oh, there's ten edges one two three four five six seven eight nine ten in the hen don't have a lot of room for a picture let's try blue here.
02:38
Let's go in that order...