NeAT - graph-cluster-membership

Map a clustering result onto a graph, and compute the membership degree between each node and each cluster, on the basis of egdes linking this node to the cluster.
This program was developed by Gipsi Lima-Mendez With the help of: Sylvain Brohée and Jacques van Helden.
Graph
   Input format 

Graph

Upload graph from file :

   
Column specification (only relevant for tab-delimited input)
Source node
Target node
Weight column



Clusters

Upload clusters from file :



Membership Matrix
   Stat 

    Number of Decimals
    RESET DEMO MANUAL MAIL