Use the provide code and modify it as appropriate without the use of Built$-$in Java Classes to Implement Floyd$$s algorithm and print the resulting connectivity matrix.

Keep the infinity representation for unreachable vertices. By doing this, you will avoid the need to check for $0$ when comparing an existing cost with a newly derived cost making it so the possible routes are less than infinity. You should be able to enter graphs of arbitrary complexity into main$().$