In the lecture we are taught that we can solve All Pairs Shortest Path(APSP) with matrix multiplication.
In APSP we are creating a distance table for all the distances between each nodes in the graph. And now the question is "Is it possible to solve Single Source Shortest Path(SSSP) problem with matrix multiplication? If it is, then how?"
If you give me an explanation how to accomplish this I would appreciate.