Can Inverse of weights(1/weight,not negation) be used to find the longest path between two points by using dijkstra's algorithm? Considering that there no cycles in the graph. 

I have seen the posts where the negation of the weights is suggested and to use Bellman-ford. But I was wondering if the inverse is possible.
Hint: take a graph with all weights equal 1.