[CG] Re: Logical Graphs • First Impressions

Logical Graphs • First Impressions 8 • https://inquiryintoinquiry.com/2024/09/06/logical-graphs-first-impressions-… Computational Representation (concl.) — At the next level of concreteness, a pointer-record data structure can be represented as follows. Pointer Structure 1 • https://inquiryintoinquiry.files.wordpress.com/2023/09/logical-graph-pointe… This portrays index₀ as the address of a record which contains the following data. • datum₁, datum₂, datum₃, …, and so on. What makes it possible to represent graph-theoretic forms as dynamic data structures is the fact that an address is just another datum to be stored on a record, and so we may have a state of affairs like the following. Pointer Structure 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. Items of data not pointing any further up the tree are treated as labels on the record-nodes where they reside, as shown below. Pointer Structure 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 direction “away from the root”. Resources — Logical Graphs • https://oeis.org/wiki/Logical_Graphs Survey of Animated Logical Graphs • https://inquiryintoinquiry.com/2024/03/18/survey-of-animated-logical-graphs… cc: https://www.academia.edu/community/5ADjXW cc: https://mathstodon.xyz/@Inquiry/113051725984818777