The Complete SPRLIB & ANNLIB

make_spcost_matrix

- compute the shortest-path distance matrix between all nodes in a SOM

SYNOPSIS

void make_spcost_matrix (net, ndim, nx, ny, spcost)

ARGUMENTS

NET *net (Trained) SOM
int ndim Number of dimensions of the SOM (1-D or 2-D)
int nx Map size in the first direction
int ny Map size in the second direction (should be 1 for 1-D SOMs)
double **spcost Result: the shortest-path distance matrix of the SOM

RETURNS

The shortest-path distance matrix of net, in spcost.

FUNCTION

Compute the shortest-path distance matrix between all nodes in a SOM. For this purpose, Dijkstra's shortest-path algorithm is used. The priority queue used in this algorithm is implemented as a binomial heap.

SEE ALSO

som_goodness , eval_set_on_net

This document was generated using api2html on Thu Mar 5 09:00:00 MET DST 1998