I'm trying to use JGraphT for some simulation over graphs.
It has the Dijkstra algorithm, and i'm not so sure that if I run the Dijkstra for a weighted graph it will consider weights.
I'm trying to get the minimum weight path from vertex a to vertex b