Enumerating all geodesics
Abstract
By "geodesic" we mean any sequence of vertices (v1,v2,...,vk) of a graph G that constitute a shortest path from v1 to vk. We propose a novel, natural algorithm to enumerate all geodesics of G, and pit it (using Mathematica) against the standard procedure for the task. The distance matrix D(G) plays a crucial role in this. In fact, part of our article is devoted to survey its many uses in related tasks.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.