Use of Floyd's Algorithm to Find Shortest Restricted Paths.

Abstract

In a directed network with no negative circuit, Floyd's algorithm finds, for each pair of nodes x and y, a shortest path from x to y. Here the procedure is extended to minimize more general length functions over sets of paths that are restricted in various ways.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1977
Accession Number
ADA049467

Entities

People

  • David Larman
  • Victor Klee

Organizations

  • University of Washington

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Computations
  • Heuristic Methods
  • Mathematical Analysis
  • Mathematics
  • Military Research
  • New York
  • Sequences
  • Universities

Readers

  • Criminal Law
  • Operations Research