Class de.aitools.js.KNNGraph

Graph procedure for local optimization
Defined in: GraphProcedures.js.

Class Summary
Constructor Attributes	Constructor Name and Description
	de.aitools.js.KNNGraph(kval, modeval) The k-nearest neighbor graph (k-NNG) is a graph in which two vertices p and q are connected by an edge, if the distance between p and q is among the k-th smallest distances from p to other objects from P.

Method Summary
Method Attributes	Method Name and Description
	execute(graph) Procedure called by the graph de.aitools.js.Graph that uses the appropriate computation.

Class Detail

de.aitools.js.KNNGraph(kval, modeval)

The k-nearest neighbor graph (k-NNG) is a graph in which two vertices p and q are connected by an edge, if the distance between p and q is among the k-th smallest distances from p to other objects from P.
Author: Christof Braeutigam christof.braeutigam@uni-weimar.de, Christian Fricke christian.fricke@uni-weimar.de.

Parameters:
{Number} kval: The approximate number of edges to be left per node
{String} modeval: The kind of computation, either normal or mutual

Method Detail

execute(graph)

Procedure called by the graph de.aitools.js.Graph that uses the appropriate computation.

Parameters:
{de.aitools.js.Graph} graph: The graph to be sorted

Classes

Class de.aitools.js.KNNGraph