Abstract
In this paper, a learning algorithm of a self-organizing map in which an input space is represented
as graph is proposed. In the conventional SOMs, the input space is defined by Euclidean space. Recently a new
method for enhancing the input space to the function space was proposed, however, these methods have been
limited to a countinous input space. The expansion of a further application can be expected by applying the
self-organizing maps to graph such as route maps and the electric circuit. The distance of the input node and the
reference element is defined by the distance in the graph, and the reference node is updated aling the shortest
route on the graph. The proposed method is applied to the travelling salesman problem with obstacles.
