Assignment 3

  1. Extend Assignment 2 to record links from each business to its four geographically closest neighbors. (You can use the Haversine formula based on longitudes and latitudes.) As a connectivity check, report the number of disjoint sets (or spanning trees from arnbitrary roots). Store persistently (possibly just in a Serialized file).
  2. Write a program (either GUI or web-based) that uses graph from step 1, allows a user to select any node, and displays graphically the shortest (weighted by any similarity metric) path between that node and the nearest (reachable) cluster center.

Doug Lea