This poster describes research to use a linear algebraic approach to graph algorithms
Software Engineering Institute
Graph algorithms can be expressed as sequences of linear, algebra-like operations through the use of the adjacency matrix. Adjacency matrices are used to represent graphs instead of vertices and edges. Our work extends the use of linear algebra beyond simple graph traversal.