Higher Level Applied Maths

Networks, Graphs & Matrices

7 Steps · all open

Start at Step 1
  1. Step 1OpenNetworks as Mathematical ModelsA network models objects as vertices and their direct connections as edges or directed arcs.
  2. Step 2OpenVertices, Edges, Weights, Paths & CyclesVertices are points, edges connect them, and a route's weight is the sum of the weights of the edges it traverses.
  3. Step 3Full accessDirected, Undirected, Connected & Disconnected GraphsEdge directions control permitted travel, while connected components group vertices joined by paths.
  4. Step 4Full accessBuilding an Adjacency MatrixA binary adjacency matrix records which pairs of vertices are connected, using a fixed row and column order.
  5. Step 5Full accessReconstructing Networks from MatricesAn adjacency matrix records which vertices are joined, with rows giving origins and columns giving destinations.
  6. Step 6Full accessMatrix MultiplicationEach entry of a matrix product is the sum of matching products from a row of the first matrix and a column of the second.
  7. Step 7Full accessInterpreting Matrix Products & Multiple RepresentationsAn entry of an adjacency matrix power counts walks of that length between the corresponding vertices.