
TL;DR
This paper introduces a new algorithm for enumerating all shortest paths (geodesics) in a graph, leveraging the distance matrix, and compares its performance with existing methods.
Contribution
A novel algorithm for enumerating all geodesics in a graph, utilizing the distance matrix, and a comparative analysis with standard procedures.
Findings
The new algorithm efficiently enumerates all geodesics.
The distance matrix is crucial for related graph tasks.
Comparison shows performance benefits over standard methods.
Abstract
By "geodesic" we mean any sequence of vertices of a graph that constitute a shortest path from to . We propose a novel, natural algorithm to enumerate all geodesics of , and pit it (using Mathematica) against the standard procedure for the task. The distance matrix plays a crucial role in this. In fact, part of our article is devoted to survey its many uses in related tasks.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization · Historical Geography and Cartography
