Home
Feed

Extend

Hashnode Pro
Hashnode for Agents

Resources

The foreword
Hashnode gql skill

Buildful - AI coding agent that delivers frontier-level results at a fraction of the cost Bug0 - The AI-native e2e QA regression testing Hackathons Changelog Brand @hashnode on X Hashnode on LinkedIn Support - hello+support@hashnode.com Code of Conduct Terms Privacy Sitemap

Search Hashnode

Search posts, tags, users, and pages

Feed/

Discussion

Rendering the Java heap as a Treemap

A failed experiment with dominator trees

Sep 25, 2024·9 min read·blog.p-y.wtfUpdated Sep 26, 2024Read the article

#computer-science
#graph-theory
#java

#kotlin

#android

#memory-management

Written by

Pierre-Yves Ricau

@py · San Francisco

View profile

Deep dives

My pronouns are he / him. Android Engineer at Square / Block. A few things I enjoy: Publishing Open Source libraries (LeakCanary, Curtains, Radiography, square/logcat) Rollerblading Writing technical blogs (previously on dev.to/pyricau) Cooking Giving tech talks Reading sci-fi

Responses1

Markdown supported · ⌘↵ to post

Nam Nguyen

Sep 25, 2024

a dominator node D of a node A is a node that if removed would make A unreachable

Should this be reversed? If you remove node D in the sample, node A is still reachable by the Root node.

Edit: or perhaps you didn't mean the A and D in the example are the same as A and D in this definition.

Pierre-Yves Ricau

Sep 26, 2024

I wrote the example later without re reading the definition I gave.. that was confusing! Fixed it, thanks!