Changes

Nodes in a graph represent ''records'' in computer memory.  A record is a collection of data that can be conceived to reside at a specific ''address''.  The address of a record is analogous to a demonstrative pronoun, on which account programmers commonly describe it as a ''pointer'' and semioticians recognize it as a type of sign called an ''index''.

Nodes in a graph represent ''records'' in computer memory.  A record is a collection of data that can be conceived to reside at a specific ''address''.  The address of a record is analogous to a demonstrative pronoun, on which account programmers commonly describe it as a ''pointer'' and semioticians recognize it as a type of sign called an ''index''.

At the next level of concreteness, a pointer-record structure may be represented as follows:

At the next level of concreteness, a pointer-record structure is represented as follows:

{| align="center" cellpadding="10"

{| align="center" cellpadding="10"

|}

|}

This portrays the pointer <math>\operatorname{index}_0</math> as the address of a record that contains the following data:

This portrays the pointer <math>\mathit{index}_0\!</math> as the address of a record that contains the following data:

{| align="center" cellpadding="10"

{| align="center" cellpadding="10"

| <math>\operatorname{datum}_1, \operatorname{datum}_2, \operatorname{datum}_3, \ldots,</math> and so on.

| <math>\mathit{datum}_1, \mathit{datum}_2, \mathit{datum}_3, \ldots,\!</math> and so on.

|}

|}