Space complexity for multiplying $m$ matrices
Letting m be [number of vertices minus 1] and letting each matrix be

[the adjacency matrix of the result of giving the vertex t a loop]

gives a reduction from st-connectivity to your problem, so no such algorithm is known.