I need to code this in Java and I cant figure out how to do this. Ive been trying to do it with the library that was provided but cant get it done. Can someone help me, please?

Below is the library I was given and I have no clue how to do it.

website: https://github.com/jgrapht/jgrapht/ or https://jgrapht.org/

Then using this library, make the following graph: 14 15 13 17 10 4 Then find the shortest path from a to g