- Step 1OpenNetworks as Mathematical ModelsA network models objects as vertices and their direct connections as edges or directed arcs.
- 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.
- Step 3Full accessDirected, Undirected, Connected & Disconnected GraphsEdge directions control permitted travel, while connected components group vertices joined by paths.
- Step 4Full accessBuilding an Adjacency MatrixA binary adjacency matrix records which pairs of vertices are connected, using a fixed row and column order.
- Step 5Full accessReconstructing Networks from MatricesAn adjacency matrix records which vertices are joined, with rows giving origins and columns giving destinations.
- 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.
- Step 7Full accessInterpreting Matrix Products & Multiple RepresentationsAn entry of an adjacency matrix power counts walks of that length between the corresponding vertices.