Matrices and Networks

Edit Answers
123456789101112131415
Across
  1. 3. This algorithm can be used to find the minimum spanning tree
  2. 4. The number of ways to travel from the start in a network diagram to the end is the "Number of ____"
  3. 5. A matrix with order 4 x 1 is an example of a ___ matrix
  4. 8. The ____ of a matrix is rows x columns
  5. 10. If a matrix is _____ by 25% a multiplier of 0.75 can be used
  6. 11. The quickest way to get from the start to the end in a network diagram is the ____ path
  7. 15. The shortest ___ can be used to minimise the cost of connecting all the nodes
Down
  1. 1. This algorithm can be used to find the shortest connection
  2. 2. If a matrix is increased by 25% a ____ of 1.25 can be used
  3. 6. In a network diagram these are connected by edges
  4. 7. If two matrices have the same order you can ___ or subtract them
  5. 9. A matrix with order 1 x 5 is an example of a ___ matrix
  6. 11. A ___ tree is a visual representation of the shortest connection
  7. 12. To be able to find AB the number of columns in A needs to equal the number of ____ in B
  8. 13. In a network diagram these connect nodes
  9. 14. For Selling price, S and Cost price, C, ____ = S - C