//leakcanary-repo/shark/HeapTraversalOutput/shortestPathTree
shortestPathTree¶
[jvm]\ abstract val shortestPathTree: ShortestPathObjectNode
A representation of the heap as a tree of shortest path from roots to each object in the heap, where:
- object identity is lost
- objects are grouped by identical path into a single node
-
Path element names are determined using the node & edge name to reach them (e.g. class name
-
field name) as well as the class name of the reached object.