A Consideration on Data Structures of a Linear Graph

概要

論文の詳細を見る
The following two things must be considered to obtain a concrete solution in any problem. The first is a description of a problem, in other words, how to represent the problem. The second is algorithm to solve a problem. These things are closely connected with each other; thus, a good representation may lead us to a perspicuous algorithm and an algorithm may restrict itself within a certain representation. Usually reprentation is scarcely made conciously. For instance, a problem on dynamical systems is often described with differential equations. Making differential equations is one of representations of the problem. In this case algorithms to solve the equations are generally given by mathematics. The importance of these two things - representation and algorithm - becomes clear especially in the case of information processing by a digital computer. Current computers have suitable arithmetic units for numerical calculations but they are not necessarily suitable for non-numerical computations. This fact has to do with representation of a problem, especially non-numerical computations. Fundamental concepts for representation (or a data structure in a computer) are described and the representation of a linear graph is considered on the basis of the concepts in this paper. Our discussions on representations may be very much effective not only in a linear graph but in many other fields.
明治大学の論文