Jump to content

I'm a software engineer, get me out of here: Difference between revisions

no edit summary
No edit summary
No edit summary
Line 29:
<br>
Part 2<br>
Six days later and you are called to another briefing. The good news is The President and his gold isare safe, so your invoice may be paid if you can get out of here. To do this a number of troop repositions will be required. It is concluded that you need to know the shortest routroute from each cell to every other cell. You decide to use Floyd's algorithm:. Print the shortest route from (21,11) to (1,11).
<br>
Extra Credit<br>
# Is there any cell in the country that can not be reached from HQ?
# Which cells will it take longest to send reinforcements to from HQ?
2,172

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.