Before revision: We investigate the single source shortest distance (SSSD) and all pairs shortest distance (APSD) problems as enumeration problems (on unweighted and integer weighted graphs), meaning that the shortest distances are produced and listed one by one without repetition.
After revision: We investigate the single source shortest distance (SSSD) and all pairs shortest distance (APSD) problems as enumeration problems (on unweighted and integer weighted graphs), meaning that the elements (u, v, d(u, v)) -- where u and v are vertices with shortest distance d(u, v) -- are produced and listed one by one without repetition.