NeAT - convert-graph

Convert graphs between different formats.
Optionally, apply a layout algorithm to position the nodes of the graph.
This program was developed by Sylvain Brohée and Jacques van Helden.

Input options

Input format 

Comment on the demonstration example

This demonstration graph consist in the top scoring edges of the yeast co-expression network downloaded from the integrative database STRING (Von Mering et al, 2007). The co-expression network contains 537 nodes and 4801 edges, weighted according to a STRING-specific co-expression score.
Graph

Upload graph from file :

   
Column specification (only relevant for tab-delimited input)
Source
Target
Weight or label
Edge color
Source node color
Target node color
Path (only for path input format)
 Undirected graph (only relevant for adjacency matrix input and output)

Output options

Output format 

Layout (only valid for GML output)
 Distinct paths (only for path input format)
Edge color scale (according to weights)
 Edge width proportional to weight

RESET DEMO MANUAL TUTORIAL MAIL