dyn.cross dynamically computes the number of edge crossings for a
given node ordering of both layers of the bi-graph. This ordering is given
by the rownames and colnames of the matrix of weights provided as argument.
The use of this function is mainly internal.
a matrix containing the intersection sizes (edge weights) between clusters (nodes) from the first partitioning (left or top layer of the bi-graph) and the second partitioning (right or bottom layer of the bi-graph). The rownames and colnames of the matrix provide the ordering of the nodes in the first and second layer, respectively.
The number of crossings in the weighted bigraph is computed by considering multiedges between connected nodes. The specific implementation uses a modification, adapted to the case of having multiple edges, of the dynamic programming algorithm developed by Nagamochi and Yamada for counting the number of crossings in non-weighted graphs, which has reduced computational cost.
the number of weighted crossings in the layout provided as argument.
Nagamochi H. and Yamada N. (2004) Counting edge crossings in a 2-layered drawing. Information Processing Letters. 91, 221-225.
barycentre, flatVSflat, flatVShier
1 2 3 4 5
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.