Changes

<center><p><math>datum_1, datum_2, datum_3, \ldots,\!</math> and so on.</p></center>

<center><p><math>datum_1, datum_2, datum_3, \ldots,\!</math> and so on.</p></center>

What makes it possible to represent graph-theoretical structures as data structures in computer memory is the fact that an address is just another datum, and so we may have a state of affairs like this:

What makes it possible to represent graph-theoretical structures as data structures in computer memory is the fact that an address is just another datum, and so we may have a state of affairs like the following:

<p>[[Image:Logical_Graph_Figure_12.jpg|center]]</p>

<p>[[Image:Logical_Graph_Figure_12.jpg|center]]</p>

Returning to the abstract level, it takes three nodes to represent the three data records illustrated above:  one root node connected to a couple of adjacent nodes.  The items of data that do not point any further up the tree are treated as labels on the record-nodes where they reside, as shown below:

Returning to the abstract level, it takes three nodes to represent the three data records illustrated above:  one root node connected to a couple of adjacent nodes.  The items of data that do not point any further up the tree are then treated as labels on the record-nodes where they reside, as shown below:

<p>[[Image:Logical_Graph_Figure_13.jpg|center]]</p>

<p>[[Image:Logical_Graph_Figure_13.jpg|center]]</p>