5. Fundamental Graph Algorithms
Jeremy T. Fineman, Eric J. Robinson · Society for Industrial and Applied Mathematics eBooks · 2011
This chapter discusses the representation of several fundamental graph algorithms as algebraic operations. Even though the underlying algorithms already exist, the algebraic representation allows for easily expressible efficient algorithms with appropriate matrix constructs. This chapter gives algorithms for single-source shortest paths, all-pairs shortest paths, and minimum spanning tree.