Upload networks with up to few thousand edges and perform your analysis. NAP is designed to profile the topology of medium-scale networks with main emphasis in:

- Exploring topological features
- Ranking nodes/edge by topological properties
- Simultaneously comparing topological features of several networks
- Plot the distribution of any topological feature
- Plot any of the topological features against another
- Use various layouts to see the network both in a dynamic/static way

The network file NAP accepts as input, an obligatory, tab-delimited file, containing all network connections. This file must contain headers, namely: 'Source' and 'Target'. A 2-column file represents the connections between the nodes and refers to an unweighted network, whereas a third column can be used for weights. Each network can be handled as directed or undirected.

Source Target Weight A B 3 A C 3 A D 4 B C 1 C D 1 A E 4 A F 5 D D1 3 A1 B1 3 A1 C1 3 A1 D1 4 B1 C1 1 C1 D1 1 A1 E1 4 A1 F1 5

NAP comes with various network generation options. Users are able to generate:

- A random scale-free network (Barabasi-Albert)
- A completely random network without any special topology (Erdos-Renyi)
- A random network with a small world topology (Watts-Strogatz)
- A bipartite network

2) Download Gavin_2006 network here

- Fruchterman-Reingold: It places nodes on the plane using the force-directed layout algorithm developed by Fruchterman and Reingold.
- Random: This function places the vertices of the graph on a 2D plane uniformly using random coordinates.
- Circle: It places vertices on a circle, ordered by their vertex ids.
- Kamada-Kawai: This layout places the vertices on a 2D plane by simulating a physical model of springs.
- Reingold-Tilford: This is a tree-like layout and is suitable for trees or graphs without many cycles.
- LGL: A force directed layout suitable for larger graphs.
- Grid: This layout places vertices on a rectangular 2D grid.
- Sphere: This layout places vertices on a rectangular 3D-like sphere.