This chart displayes hierarchical data in a radial layout:
The circle in the chart center represents the hierarchy's root node.
Sections further outside represent nodes that are located deeper in the hierarchy.
Each leaf node has a attached value attribute. For sections corresponding to leaf nodes, the area is derived from the leaf node's value attribute. For sections not corresponding to leaf nodes, the area is derived from the accumulated value of all descending leaf nodes.
This node expects a data structure that satisfies certain requirements:
The following table gives an example for such a data structure:
You want to see the source code for this node? Click the following button and we’ll use our super-powers to find it for you.
A zipped version of the software site can be downloaded here.
Deploy, schedule, execute, and monitor your KNIME workflows locally, in the cloud or on-premises – with our brand new NodePit Runner.Try NodePit Runner!
Do you have feedback, questions, comments about NodePit, want to support this platform, or want your own nodes or workflows listed here as well? Do you think, the search results could be improved or something is missing? Then please get in touch! Alternatively, you can send us an email to email@example.com, follow @NodePit on Twitter, or chat on Gitter!
Please note that this is only about NodePit. We do not provide general support for KNIME — please use the KNIME forums instead.