SHORTEST-PATH PROBLEM IS NOT HARDER THAN MATRIX MULTIPLICATION