Computing and Information Technology Interactive Digital Educational Library

 

CITIDEL >
Planet Math Computer Science  >
Planet Math Computer Science Collection >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10117/1287

Title: Floyd's algorithm
Issue Date: 3-Feb-2002
Publisher: PlanetMath
Citation: http://planetmath.org/encyclopedia/FloydsAlgorithm.html
Abstract: Floyd's algorithm is also known as the all pairs shortest path algorithm. It will compute the shortest path between all possible pairs of vertices in a (possibly weighted) graph or digraph simultaneously in ... time (where
URI: http://www.citidel.org/handle/10117/1287
Appears in Collections:Planet Math Computer Science Collection

Files in This Item:

File SizeFormat
FloydsAlgorithm.html21KbHTMLView/Open

All items in DSpace are protected by copyright, with all rights reserved.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2006 MIT and Hewlett-Packard - Feedback