NeAT - graph-topology

Calculate various node topology statistics : the node degree, the betweenness and the closeness. In directed graph, it specifies whether the nodes are only source or target nodes.
This program was developed by Sylvain Brohée and Jacques van Helden.
   Input format  

Graph

Upload graph from file :

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

Return fields
Degree
BetweennessWarning May be time consuming depending on the number of nodes of the graph
Closeness

 Directed graph



Node selection

All nodes
List of nodes

Upload nodes from file :