If ever your Djkstra algorithms are in a situation where the max weight is much smaller than the number of vertices in your graph, try transforming each weight of size "x" into "x" new edges connected by new vertices and this will turn your Problem from the most short weighted paths into a weightless problem which will be solved in complexity O ("max weight" x "number of vertices") which is asymptotically better and faster than the basic problem. Tell me if you find something wrong.
Thank you