Floyd-Warshall Algorithm

Floyd-Warshall Algorithm

List price: US$47.99

Currently unavailable

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks

Description

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computer science, the Floyd-Warshall algorithm is a graph analysis algorithm for finding shortest paths in a weighted graph. A single execution of the algorithm will find the lengths of the shortest paths between all pairs of vertices though it does not return details of the paths themselves. The algorithm is an example of dynamic programming. It was published in its currently recognized form by Robert Floyd in 1962. However, it is essentially the same as algorithms previously published by Bernard Roy in 1959 and also by Stephen Warshall in 1962 for finding the transitive closure of a graph.show more

Product details

  • Paperback | 96 pages
  • 152 x 229 x 6mm | 150g
  • Anim Publishing
  • United States
  • English
  • 6136600110
  • 9786136600116