The size of the nodes indicates the number of works in each node, while the thicknes of the nodes indicates the proportion of overlapping works of the maximum possible, i.e. \(p_{i,j} = \frac{n_{\text{links}(i,j)}}{\min(n_i, n_j)}\)
+
The size of the nodes indicates the number of works in each node, while the thicknes of the edges (lines) indicates the proportion of overlapping works of the maximum possible, i.e. \(p_{i,j} = \frac{n_{\text{links}(i,j)}}{\min(n_i, n_j)}\)
The nodes can be moved and if selected, the links to / from that node are highlighted.
[x] Matrix showing overlap of Strategies / Options Cases Only
+
The size of the nodes indicates the number of works in each node, while the thicknes of the edges (lines) indicates the proportion of overlapping works of the maximum possible, i.e. \(p_{i,j} = \frac{n_{\text{links}(i,j)}}{\min(n_i, n_j)}\)
+
The nodes can be moved and if selected, the links to / from that node are highlighted.
The size of the nodes indicates the number of works in each node, while the thicknes of the nodes indicates the proportion of overlapping works of the maximum possible, i.e. \(p_{i,j} = \frac{n_{\text{links}(i,j)}}{\min(n_i, n_j)}\)
+
The size of the nodes indicates the number of works in each node, while the thicknes of the edges (lines) indicates the proportion of overlapping works of the maximum possible, i.e. \(p_{i,j} = \frac{n_{\text{links}(i,j)}}{\min(n_i, n_j)}\)
The nodes can be moved and if selected, the links to / from that node are highlighted.
The size of the nodes indicates the number of works in each node, while the thicknes of the edges (lines) indicates the proportion of overlapping works of the maximum possible, i.e. \(p_{i,j} = \frac{n_{\text{links}(i,j)}}{\min(n_i, n_j)}\)
+
The nodes can be moved and if selected, the links to / from that node are highlighted.
The colour indicates s indicates the proportion of overlapping works of the maximum possible, i.e. \(p_{i,j} = \frac{n_{\text{links}(i,j)}}{\min(n_i, n_j)}\)
The colour indicates s indicates the proportion of overlapping works of the maximum possible, i.e. \(p_{i,j} = \frac{n_{\text{links}(i,j)}}{\min(n_i, n_j)}\)