You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
We currently colour nodes based on NEO:Label assuming 1 label per term, but this assumption will not hold in future. While I think it is unlikely that nodes will have more that 2-3 classifications max, I think it is reasonable to support a max of 5.
Suggested solution
Divide the top panel, which is currently used to display the colour, into n segments where n = number of labels, with a max of n=5. Each segment takes one colour.
The aim of this ticket is a solution to this UI issue. The following text deals with the issue of generating a non-redundant list of labels. It should be used as the starting point for further tickets.
Note - the queries themselves may return a relatively large, partly redundant list of labels for each node. We will provide a data structure + an algorithm for operating on it which will allow this to be reduced to a small, non-redundant list. Right now, this data-structure consists of a single ranked-order list. We may stick with this arrangement in order to release MVP, but this will be replaced by a graph structure that can be used to determine a non-redundant list of labels to apply, given any label input. Note - the same problem of displaying non-redundant label lists is faced elsewhere in the app, so ideally the data-structure and the code for using it will be centralised.
The text was updated successfully, but these errors were encountered:
We currently colour nodes based on NEO:Label assuming 1 label per term, but this assumption will not hold in future. While I think it is unlikely that nodes will have more that 2-3 classifications max, I think it is reasonable to support a max of 5.
Suggested solution
Divide the top panel, which is currently used to display the colour, into n segments where n = number of labels, with a max of n=5. Each segment takes one colour.
The aim of this ticket is a solution to this UI issue. The following text deals with the issue of generating a non-redundant list of labels. It should be used as the starting point for further tickets.
Note - the queries themselves may return a relatively large, partly redundant list of labels for each node. We will provide a data structure + an algorithm for operating on it which will allow this to be reduced to a small, non-redundant list. Right now, this data-structure consists of a single ranked-order list. We may stick with this arrangement in order to release MVP, but this will be replaced by a graph structure that can be used to determine a non-redundant list of labels to apply, given any label input. Note - the same problem of displaying non-redundant label lists is faced elsewhere in the app, so ideally the data-structure and the code for using it will be centralised.
The text was updated successfully, but these errors were encountered: