Recalling the case shown in the previous article that we established the need to establish a route through a data structure based on trees or graphs, let us first take into account that the data of each node are named using "class", that is, that they can group both data and operations to be performed, and that in each case the operations to be performed may be implemented as a particular version or even as an extended version of the "base" operation of the corresponding "class".

With these data types each variable will have to be "initialized" in order to exist since the "class" only defines a data type, just as the basic types do for integer or real.

To continue reading please click here.



Pin It

No thoughts on “04. Finish and Versions. Fourth part.”

Leave your comment

In reply to Some User