This page explains how to realise a really basic circle packing with several level of hierarchy. This kind of chart represents a hierarchy: The biggest circle (origin of the hierarchy) contains several big circles (nodes of level 1), that contains smaller circle (level 2) and so on.. The last level is called leaf.


The input data is a list of edges between nodes. It should look more or less like the table below. Moreover, we usually accompany this table with another one that gives features for each node.


We are going to use the awesome ggraph library by Thomas Lin Pedersen to make this circle packing. Here is the code.



Note that the ggraph library allows to easily go from one type of representation to another. Indeed several types of representation are suitable for hierarchical data: dendrogram (can be circular), treemap, sunburst diagram or network!








Make a search



Leave a Reply

Be the First to Comment!

Notify of