Hi, if a diagram has n
nodes and m
edges, does findNodeForKey
do the sequential lookup on the nodeDataArray
with O(n)
performance? And does findLinkForKey
do the sequential lookup on the nodeLinkArray
with O(m)
performance?
Does GoJS do any internal caching or mapping to make the lookup more efficient?
Thanks,
Min