RSAT
NeAT
Network Analysis Tools
> view all tools
Networks
Network comparison
Node topology statistics
Get node neighborhood
Randomize network
Alter network
Format conversion / layout calculation
Graph display
Path finding and pathway extraction
k-shortest path finding
Metabolic path finding
Pathway extraction
Pathway extraction (microme prototype)
Clusters
Compare classes/clusters
Contingency stats
Convert classification to different format
Clusters/Networks
MCL clustering
RNSC clustering
Map clusters onto network
Cluster membership
Graphics
Draw heatmap
Roc curves
ROC curves and stats
Data
Collect data from external servers
Download a subgraph from STRING
Download organism-specific networks from KEGG
Sample data
DEMO data
Nature protocol data
Web services
Documentation and clients
Taverna workflows
Help
Site map
Tutorial
Contact & Forum
Information
Introduction
People
Publications
Distribution
Credits
Links
Feedback
Sylvain Brohée
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
tab-delimited format
Adjacency matrix
GML 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
Betweenness
Warning
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 :
RESET
DEMO
MANUAL
TUTORIAL
MAIL