Sparse matrix techniques for the shortest path problem

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 here are powerful when a network of fixed sparseness structure must be solved repeatedly with different numerical values.