English: When a graph is represented by a matrix, matrix multiplication acts as a step forward in a breadth first search. In this example, the inputs are a matrix that represents the graph, A, and a vector of the starting node in the graph to search from. The result of the multiplication is the next step in a breadth first search, being the nodes adjacent to node 4, which are nodes 1 and 3.
to share – to copy, distribute and transmit the work
to remix – to adapt the work
Under the following conditions:
attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
https://creativecommons.org/licenses/by/4.0CC BY 4.0 Creative Commons Attribution 4.0 truetrue
Captions
Matrix multiplication is a step in a breadth first search across an adjacency matrix.