[CG] Re: Logical Graphs • First Impressions

Logical Graphs • First Impressions 8 • https://inquiryintoinquiry.com/2023/08/24/logical-graphs-first-impressions/ Computational Representation (concl.) — At the next level of concreteness, a pointer‑record data structure can be represented as follows. Pointer Example 1 • https://inquiryintoinquiry.files.wordpress.com/2023/09/logical-graph-pointe… This portrays “index_0” as the address of a record which contains the following data. • datum_1, datum_2, datum_3, …, and so on. 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. Pointer Example 2 • https://inquiryintoinquiry.files.wordpress.com/2023/09/logical-graph-pointe… 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. Pointer Example 3 • https://inquiryintoinquiry.files.wordpress.com/2023/09/logical-graph-pointe… Notice that drawing the arrows is optional with rooted trees like these, since singling out a unique node as the root induces a unique orientation on all the edges of the tree, with “up” being the same direction as “away from the root”. Regards, Jon cc: https://www.academia.edu/community/5RJb65 cc: https://mathstodon.xyz/@Inquiry/110945139629369891