Next:
Introduction and General Overview
CMSC420 Project - Spring 2019
Part 2, Draft Version 2.
Due date: max(syllabus, submit server late)
The BIG 420 Project: MeeshQuest
Date:
Last Modified March 3, 2019
Introduction and General Overview
MeeshQuest Components
Dictionary Data Structure
Spatial Data Structure
Adjacency List
Mediator
Roadmap
Project I/O: XML and Conventions
Part 2 Update: Data dictionaries and notes about Cities
Part 1: Comparators, Treemaps, Cities, PR Quadtrees and Range Searches
Part 2: Sorted Map Insert, the Treap, Polygonal Maps, and Road Adjacency Lists
Treap Definition and Requirements
Important Notes about the Treap
Treap Implements Sorted Map Requirements
Caution:
entrySet() is tricky
Testing SortedMap:
equals(), hashCode(), and toString()
must work
Map.Entry
AbstractMap and AbstractSet
Anonymous Inner Classes
PM Quadtrees
PM Pseudocode
Hints for using PM pseudocode
Validator Object
Adjacency List
Shortest Path, and Heaps
Dijkstra's algorithm
Annotated Driving Directions
Boundary Conditions
Calculating Angles
XML Specifications
XML Input Basics (Reminders)
General XML Output for Part 2 (and Part 3)
Commands for Part 2
General Policies
Grading Your Project
Criteria for Submission-Summer 2017
README file Contents
Project Testing and Analysis
Grading
Testing Process Details
Small, Yet Costly, Errors
Standard Disclaimer: Right to Fail (twice for emphasis!)
Integrity Policy
Code Sharing Policy
Bibliography
About this document ...
MM Hugue 2019-03-03
