P-Y on Nostr: When you look at the JVM heap as a directed graph of objects, you can think of most ...

When you look at the JVM heap as a directed graph of objects, you can think of most data structures,.e.g. hashmap, as having edges towards the map (references to the map) and edges out of the map (from keys and values), and then there's all the other nodes and edges inside the map (e.g. the backing arry and linked hashnodes). I want a name for the insides.