1,276 bytes added
, 16:28, 30 September 2013
Will return the name and location of the closest isolated city to the specified point in the spatial map. To do this correctly, you may want to use the PriorityQueue from part 1 ([http://www.cs.umd.edu/users/meesh/cmsc420/Notes/neighbornotes/incnear.pdf this] or [http://www.cs.umd.edu/users/meesh/cmsc420/Notes/neighbornotes/incnear2.pdf this]) – otherwise, you might not be fast enough for large data sets. In the case of a tie (two cities equally far away from the point), choose the city with the asciibetically least name. The ordering by name is asciibetical according to the java.lang.String.compareTo() method.
== Parameters (In output order) ==
* x
* y
== Possible ''<output>'' ==
The output will contain one city tag which is the nearest city. This is an example of a city tag:
<code>
<isolatedCity name="city1" x="coordx" y="coordy" color="color1" radius="radius1"/>
</code>
== Possible ''<error>'' types ==
* cityNotFound
== ''<success>'' Example ==
<code>
<success>
<command name="nearestIsolatedCity" id="8"/>
<parameters>
<x value="1"/>
<y value="2"/>
</parameters>
<output>
<city name="Annapolis" x="20" y="30" color="red" radius="12"/>
</output>
</success>
</code>