Mathematica MathWorld Wolfram Science More »

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.


	Contributed by: Seth J. Chandler
	Show Initialization Code

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

Report an issue »

	Source page:
	Email	Name (optional)
	Occupation (optional)	Organization (optional)
	I use Mathematica often occasionally never
	Country (optional) Remember me
	Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed. Privacy Policy »

RSS

Atom