I've reconfigured the GEXF file generation so that it now only generates a single edge for each pair of locations in the input set, and for weighting, it is set by default to count the number of documents in which both locations appear. This results in a simpler and perhaps more meaningful graph.

Following that, I've started work on map_full.xql, which generates a colour-coded display of a set of locations passed in the GET or POST array, on a full-scale view of all the tiles, laid out in a table. This is a quick-and-dirty way of mapping the results of our network mapping. The initial graphing of the most commonly-mentioned locations in our db resuls in three distinct communities, and I can now map those locations colour-coded by community on the full-scale map.