Re: [jgrapht-users] bellman ford

[nnn123 <nur...@gm...>]

I need to display the branch and bound algorithm on a the graph so I use
listenablegraph, I need to find the longest path I use bellman ford with
negative weights but i get rong path so I check with a positive weight also
did not work.

Is there a way to make jgrapht get weights that I give him?

--
View this message in context: http://jgrapht-users.107614.n3.nabble.com/bellman-ford-tp4006658p4008075.html
Sent from the jgrapht-users mailing list archive at Nabble.com.