Modelling With Matrices: What Are Connectivity Matrices

In this video I explain the basics of what connectivity matrices show and how to create them manually from a network.

[@Syntaxxed]

can't count how many times I've been saved by heroes on youtube. Thank you!

[@babycoop1792]

very well detailed good job mate

[@ayahussain9812]

Thank you !

[@erick-alfaro]

Thanks Jamie Vardy

[@chandrashekharthakur4093]

I didn´t get the solution from D - B. I think in place of 2 there exists 1. Could you please explain it?

[@shobapandian]

yes correct

[@fricitron]

thanks from russia)

[@milujose1491]

How did we have a two step connection in both F to D and D to F. There can only be one. Shouldn't the table be as follow? A B C D E F ------------- Destination A 0 0 1 0 0 0 B 1 1 0 1 0 1 C 0 1 3 0 2 0 D 1 1 0 1 0 2 E 0 0 1 0 1 0 F 1 1 0 1 0 2

[@tskart5745]

nope, you can go from D-E-F and D-C-F and same for F to D but in reverse

[@Keircomb181]

FROM C TO F THERE IS 1 ROUTE NOT 0 NO?

[@BellCurvedEducation]

Yes you are correct, but I have indicated that with a 1 in the matrix? The first matrix I wrote in pink was the "C" matrix which shows the one-step connections between nodes. The second matrix I wrote in blue was the "C^2" matrix, which shows the two-step connections between nodes. Now starting at node C, there is no way to finish at node F if you have to take exactly two steps. Hence there is a zero in the blue matrix. That's the only thing I can think of. I hope that helps. If not just let me know what you are referring to exactly.

[@Keircomb181]

Bell Curved Education what happens if you take a bidirectional link forward & then backward ? Or should it be only one link per movement ?

[@BellCurvedEducation]

@@Keircomb181 Going forward and then backwards would count as taking two steps and hence be a two step connection.

[@sanavdurgam8164]

Thank you!