Unit Shortest Path Algorithm with Maximum Adjacency Point Storage

The unit shortest path algorithm using maximum adjacency point storage utilizes the maximum number of adjacent nodes in a network as a key parameter. By taking the maximum adjacency count as matrix columns and total node count as rows, it constructs an adjacency node matrix M-PJ to describe network topology. Rows are ordered by ascending node indices, with adjacent nodes of node I listed in row I. If a node has fewer adjacent nodes than the maximum, zeros pad the remaining positions. Corresponding edge weights are mapped to create an initial judgment matrix M-PDJ. Using these matrices, the algorithm efficiently computes shortest paths between any two nodes while optimizing storage through fixed-size matrix structures.