Skip to Main Content
A new method is given for finding all shortest distances in a directed network. The amount of work (in performing additions, subtractions, and comparisons) is slightly more than half of that required in the best of previous methods.
Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.