Abstract
Two methods of implementing computer programs for solving the shortest path problem are presented. By symbolic processing, a computer program generates another program or an address table which represents an optimal shortest path algorithm, in the sense that only nontrivial operations required for a given particular network structure are executed. The implementation methods presented are powerful when a network of fixed sparseness structure must be solved repeatedly with different numerical values.
Original language | English |
---|---|
Title of host publication | IEEE Trans Circuits Syst |
Pages | 752-758 |
Number of pages | 7 |
Volume | CAS-23 |
Edition | 12 |
Publication status | Published - 1976 Dec |
Externally published | Yes |
ASJC Scopus subject areas
- Engineering(all)