In 03:35 . Many people takes convention that the loop contribute 2 to the corresponding entry in the adjacency matrix. But you took 1 why ? Also answer please which value should be right ?
It seems to vary depending on what the application is and curriculum being taught. For the particular curriculum that I teach, 1 is the entry that we use. There is one edge so we use 1 however the degree is 2.
@@molloymaths1092 Thank you so much! I have a question, how am I supposed to find the paths of lets say 5 efficiently without using a computer. Do I have to multiply the entire matrix 5 different times?
@@mmomarr If you're talking about the number of walks by squaring, cubing etc. I think that in the exam they will not require you to multiply a matrix five times. I may be wrong, but it would be a waste of time in the exam.
In 03:35 . Many people takes convention that the loop contribute 2 to the corresponding entry in the adjacency matrix. But you took 1 why ? Also answer please which value should be right ?
It seems to vary depending on what the application is and curriculum being taught. For the particular curriculum that I teach, 1 is the entry that we use. There is one edge so we use 1 however the degree is 2.
Hello, which video did you make regarding multiplying vertices? I would like to watch it. Thank you.
ruclips.net/video/xMQjLzVq9No/видео.html
@@molloymaths1092 Thank you so much! I have a question, how am I supposed to find the paths of lets say 5 efficiently without using a computer. Do I have to multiply the entire matrix 5 different times?
@@mmomarr If you're talking about the number of walks by squaring, cubing etc. I think that in the exam they will not require you to multiply a matrix five times. I may be wrong, but it would be a waste of time in the exam.