Roadmap

This is a roadmap of the major component that we will use in each part of the project. An asterisk (*) indicates that we will be reusing the structure from the previous project with little or no modification. ``i'' stands for insert, ``f'' stands for find, and ``d'' stands for delete. (The command parser will have new commands added with each project, but the overall design need not change after project 1 unless you want to make it more efficient or elegant.)

Part	Dictionary	Spatial	Adj. List	Application	Mediator
0	Treemaps (i/f/d)	n/a	n/a	n/a	Any implementation
1	Treemaps (i/f/d)	PR Quad (i/f/d)	n/a	n/a	Any implementation
2	AVL-G (i/f)	PM3 Quadtree (i/f)	Any (i/f/d) in $O(\log n)$	Dijkstra/Shortest Path	*
3	AVL-G (i/f/d)	PR of PM1/3 Quadtrees (i/f/d)	*	MST	*

****NOTE: This roadmap is subject to change as the semester progresses.****