The line an am5hierarchy.ForceDirected drew between two nodes.
A network is the one reading whose payload is not a walk over data items: its
links are the tree's parent-child edges plus the cross-links the rows named,
and amCharts draws them from a list of its own. So a published index is
inverted against the emitted point — layer.data[i] names two nodes — and
the line is then found by asking each drawn link which two nodes it joins,
with networkLinkKey settling the direction the payload does not
carry.
series.links and a link's source / target node data items are
unverifiable without the library, like every other sprite read here. A build
that answers with neither leaves every link unfound, the resolver answers
nothing, and the overlay clears — which is what a network did in full before
this existed, rather than a line drawn somewhere plausible.
The line an
am5hierarchy.ForceDirecteddrew between two nodes.A network is the one reading whose payload is not a walk over data items: its links are the tree's parent-child edges plus the cross-links the rows named, and amCharts draws them from a list of its own. So a published index is inverted against the emitted point —
layer.data[i]names two nodes — and the line is then found by asking each drawn link which two nodes it joins, with networkLinkKey settling the direction the payload does not carry.series.linksand a link'ssource/targetnode data items are unverifiable without the library, like every other sprite read here. A build that answers with neither leaves every link unfound, the resolver answers nothing, and the overlay clears — which is what a network did in full before this existed, rather than a line drawn somewhere plausible.