Dynamic Proximity Networks
You can generate a directed graph by giving spatial coordinates to a list of nodes and then connecting each node with its -nearest neighbors, nearest being defined according to some distance measure. This Demonstration lets you create such directed graphs by setting down a list of "Locators" and letting you move them about. It outputs the resulting graph and a user-specified embedding of the resulting graph. The Demonstration permits you to change both the distance measure and the embedding.
Snapshot 1: highÃ¢ÂÂdimensional embedding of thumbnail graph but using Euclidean distance function
Snapshot 2: 4-regular network with embedding using Manhattan distance
Snapshot 3: 5-regular network with embedding using Canberra distance