MIT网络分析工具.docxVIP

Archived Version (frozen Nov. 2011)The code is classified by functionality as follows (121 routines total, last version Nov 6, 2011). All functions can be downloaded?here.Basic network routines (17)getNodes.m?- return the list of nodes for varying graph representations;getEdges.m?- return the list of edges for varying graph representations;numnodes.m?- number of vertices/nodes in the network;numedges.m?- number of edges/links in the network;link_density.m?- the density of links of the graph;selfloops.m?- number of selfloops, i.e. nodes connected to themselves;multiedges.m?- number of arcs (i,j