Reformulating a breadth-first search algorithm on an undirected graph in the language of linear algebra.

Keywords

Abstract