Let G = (V, E,w) be a weighted directed graph, where w : \rm E \to {-M, . . . , 0, . . . , M}. We show that G can be preprocessed in O(m^\omega) time, where \omega < 2.376 is the exponent of fast matrix multiplication, such that subsequently, each distance \delta (\upsilon ,\nu ) in the graph, where \upsilon ,\nu \varepsilon V , can be computed exactly in O(n) time. We also present a tradeoff between the processing time and the query answering time. As a very special case, we obtain an O(m^\omega) time algorithm for the Single Source Shortest Paths (SSSP) problem for directed graphs with integer weights of absolute value at most M. For suf?ciently dense graphs, with small enough edge weights, this improves upon the O(m\sqrt n \log M) time algorithm of Goldberg. We note that even the case M = 1, in which all the edge weights are in {-1, 0, +1}, is an interesting case for which no improvement over Goldberg?s O(m\sqrt n ) algorithm was known. Our new Õ(n^\omega) algorithm is faster whenever m > n^{\omega - 1/2} \simeq n^{1.876}.