We have some data that, after long debate in our group, we have
decided to represent using a JTree (i.e. this choice is a hard
constraint on further design).
The nodes of this tree fall into disjoint sets, each set consisting of
up to about 10 elements. For any node in the tree, the other nodes
that belong to the same set can be dispersed widely all over the tree.
The problem is to modify the functionality of JTree so that
selecting/deselecting one node automatically selects/deselects all the
nodes in the same set.
What's the best way to modify this behavior? Where does the code
responsible for highlighting selected nodes reside?
Thanks,
KJ
decided to represent using a JTree (i.e. this choice is a hard
constraint on further design).
The nodes of this tree fall into disjoint sets, each set consisting of
up to about 10 elements. For any node in the tree, the other nodes
that belong to the same set can be dispersed widely all over the tree.
The problem is to modify the functionality of JTree so that
selecting/deselecting one node automatically selects/deselects all the
nodes in the same set.
What's the best way to modify this behavior? Where does the code
responsible for highlighting selected nodes reside?
Thanks,
KJ