抄録
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.
| 本文言語 | English |
|---|---|
| ホスト出版物のタイトル | IEEE Trans Circuits Syst |
| ページ | 752-758 |
| ページ数 | 7 |
| 巻 | CAS-23 |
| 版 | 12 |
| 出版ステータス | Published - 1976 12月 |
| 外部発表 | はい |
ASJC Scopus subject areas
- 工学（全般）