KSPTH: a subroutine for the K shortest paths in a sabotage graph
Finding shortest paths in a weighted graph model is one way for a safeguards analyst to locate weaknesses in a facility's barrier and alarm system. KSPTH can be used to rank sabotage paths according to path length so that the K shortest paths can be studied by more detailed methods to see which possess additional properties attractive to an adversary. While emphasizing how to use KSPTH, this report explains the K-th shortest path algorithm of Hoffman, Pavley and Dreyfus and contains a sample problem test results and program listings.
- Research Organization:
- Sandia Labs., Albuquerque, N.Mex. (USA)
- DOE Contract Number:
- EY-76-C-04-0789
- OSTI ID:
- 7085571
- Report Number(s):
- SAND-77-1165
- Country of Publication:
- United States
- Language:
- English
Similar Records
SPTH3: subroutine for finding shortest sabotage paths
POST: a subroutine for Path Ordering of Sabotage Targets
Pathfinding in graph-theoretic sabotage models. I. Simultaneous attack by several teams
Technical Report
·
Fri Jul 01 00:00:00 EDT 1977
·
OSTI ID:7089490
POST: a subroutine for Path Ordering of Sabotage Targets
Technical Report
·
Thu Jan 31 23:00:00 EST 1980
·
OSTI ID:5352881
Pathfinding in graph-theoretic sabotage models. I. Simultaneous attack by several teams
Technical Report
·
Thu Jul 01 00:00:00 EDT 1976
·
OSTI ID:7341740