
Originally Posted by
sdinulescu
An airline company offers daily flights among Budapest, Frankfurt, Tunis, and Windsor
The number of daily direct flights is as follow:
From Windsor - 2 flights to Tunis, one flight to Budapest and one flight to Frankfurt
From Budapest there are 2 flights to Windsor
From Tunis there is one flight to Windsor and one to Frankfurt
From Frankfurt there are two flights to Windsor and one to Tunis
I've found the matrix that indicate the number of routes between cities which is
WjW B F T
WX0 1 1 2
BX2 0 0 0
FX2 0 0 1
TX1 0 1 0
My question is - indicate the matrix operation that show the number of ways that a plane can go between two cities, either directly or through at most one city
R + Rsquared (I've been told) but I don't understand why. I need some feedback.