Classically, many graph algorithms in computer science operate on representations of graphs other than the adjacency matrix. For example, the breadth-first search and many more complex shortest-path algorithms most often ...