Line 32: |
Line 32: |
| | | |
| * [[createCity]]: You will need to be able to add cities to the data dictionary. No two cities can have the same coordinates or name. | | * [[createCity]]: You will need to be able to add cities to the data dictionary. No two cities can have the same coordinates or name. |
| + | * [[clearAll]]: Clears all of the data structures, removing all elements. |
| + | * [[listCities]]: Output a sorted (XML) list of cities in the data dictionary. |
| + | * [[printHeptaTrie]]: Prints the structure of your HeptaTrie using rules from Section 7 of the spec. |
| * [[mapRoad]]: Map a road in the spatial map. | | * [[mapRoad]]: Map a road in the spatial map. |
− | * [[listCities]]: Output a sorted (XML) list of cities in the data dictionary. | + | * [[mapCity]]: Map a city in the spatial map. |
| + | * [[printPMQuadtree]]: This outputs an XML (textual) representation of the spatial map. |
| + | * [[saveMap]]: This outputs a visual representation (an image) of the spatial data structure. See [http://wam.umd.edu/~bzoller/cmsc420/doc/cmsc420/drawing/CanvasPlus.html CanvasPlus]. |
| * [[rangeCities]]: This searches the spatial data structure for all cities within a given radius of a given point. Optionally save a visual representation of the command to an image file. | | * [[rangeCities]]: This searches the spatial data structure for all cities within a given radius of a given point. Optionally save a visual representation of the command to an image file. |
| + | * [[rangeRoads]]: This searches the spatial data structure for all roads within a given radius of a given point. |
| * [[nearestCity]]: This finds the nearest city in the spatial map to a given point. | | * [[nearestCity]]: This finds the nearest city in the spatial map to a given point. |
− | * [[printBTree]]: This outputs an XML representation of the data dictionary. | + | * [[nearestIsolatedCity]]: This finds the nearest isolated city in the spatial map to a given point. |
− | * [[printPMQuadtree]]: This outputs an XML (textual) representation of the spatial map. | + | * [[nearestRoad]]: This finds the nearest road in the spatial map to a given point. |
− | * [[saveMap]]: This outputs a visual representation (an image) of the spatial data structure. See [http://wam.umd.edu/~bzoller/cmsc420/doc/cmsc420/drawing/CanvasPlus.html CanvasPlus]. | + | * [[nearestCityToRoad]]: This finds the nearest road in the spatial map to a given point. |
− | * [[clearAll]]: Clears all of the data structures, removing all elements.
| |
| * [[shortestPath]]: Computes the shortest path between two cities. Optionally saves the path to an image file using [http://wam.umd.edu/~bzoller/cmsc420/doc/cmsc420/drawing/CanvasPlus.html CanvasPlus] or generates an HTML file for the shortest path using [http://en.wikipedia.org/wiki/XSLT XSLT]. | | * [[shortestPath]]: Computes the shortest path between two cities. Optionally saves the path to an image file using [http://wam.umd.edu/~bzoller/cmsc420/doc/cmsc420/drawing/CanvasPlus.html CanvasPlus] or generates an HTML file for the shortest path using [http://en.wikipedia.org/wiki/XSLT XSLT]. |