Skip to main content
Book Chapter

Practical Algorithms for the All-Pairs Shortest Path Problem

  • Brodnik A
  • Grgurovič M
DOI: 10.1007/978-3-319-77510-4_6
N/ACitations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We study practical algorithms for solving the all-pairs shortest path problem. The Floyd-Warshall algorithm is frequently used to solve the aforementioned problem, and we show how it …

Cite

CITATION STYLE

APA

Brodnik, A., & Grgurovič, M. (2018). Practical Algorithms for the All-Pairs Shortest Path Problem (pp. 163–180). https://doi.org/10.1007/978-3-319-77510-4_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free