Search for shortest paths based on a projective description of unweighted graphs

V. A. Melent'ev

The search is based on the preliminary transformation of matrices or adjacency lists traditionally used in the study of graphs into projections cleared of redundant information (re…