I'm a software engineer, get me out of here: Difference between revisions
I'm a software engineer, get me out of here (view source)
Revision as of 11:06, 5 August 2018
, 5 years agono 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 are 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 route from each cell to every other cell. You decide to use Floyd's algorithm. Print the shortest route from (21,11) to (1,11) and from (1,11) to (21,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?
<br>
Related tasks:
# [[Dijkstra's algorithm]]
# [[Floyd-Warshall algorithm]]
|