Description:

To simplify analyzing connections between groups in multipartite graphs, minimizing edge crossings is a good way to do so. In this work, by using the algorithm suggested in the paper “An Edge Crossing Minimization Algorithm Based on Adjacency Matrix Transformation�?, implementation for gephi platform is performed.

Author:

  • Kemal BESKARDESLER

Sources:

github.com/kemalceng/gephi-plugins/

License:

GPL v3

Compatible Gephi versions: