Provided is a complete program for implementing a directed weighted graph. The only problem is that my getCheapestPath method located inside DirectedGraph.java is returning the most expensive path. My program is too large to fit in cheggs editor, so I have supplied a link to download a .txt file titled AlmostComplete which contains all the necessary classes to implement the program. There are just a lot of interface classes all of which are implemented fully. This should be an easy solution, don;t let the fact that theres "a lot" of source code scare you off. Please do not provide an answer cointaining code that differs from what I am providing. Just provide the code for the class(es) that needed editting.

Link1(no ads should work): https://file.town/download/xxegy5msy63z2ryrw7gm233yx

Link2(non malicious ad page, works everytime I've tried): https://s.file.town/mMl

Replace all $ with / and replace "try" with https, and replace spaces with dots

try:$$s file town$mMI

Please tell me in comments if this works

If you edit the try above into the link it should open a page that after 5 sec you can download the .txt

My code is too many characters and chegg doesnt allow me to paste it and post, any suggestions?