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) with multiple edges across them;average_degree.m?- the average degree (# links) across all nodes;num_conn_comp.m?- number of connected components (using algebraic connectivity);find_conn_comp.m?- the number of connected components in an undirected graph;giant_component.m?- extract the giant component only (undirected graph);tarjan.m?- find the strongly connected components in a directed graph;graph_complement.m?- the complement graph;graph_dual.m?- the graph dual (or line graph, adjoint graph);subgraph.m?- return the subgraph adjacency given the graph and the subgraph nodes;leaf_nodes.m?- nodes connected to only one other node;leaf_edges.m?- edges with only one adjacent edge;Diagnostics (11)issimple.m?- check whether the graph has selfloops and multiple edges;isdirected.m?- directed or undirected graph (right now uses issymmetric.m);issymmetric.m?- check whether a matrix is symmetric;isconnected.m?- check whether a graph is connected;isweighted.m?- determine whether the graph has weighted links;isregular.m?- check whether its a regular graph;iscomplete.m?- check whether the graph is complete;iseulerian.m?- find out whether its an eulerian graph;istree.m?- check whether the graph is a tree;isgraphic.m?- check whether a sequence of numbers is graphic;isbipartite.m?- check whether a graph is bipartite;Conversion routines (14)adj2adjL.m, (adjL2adj.m) - convert an adjacency matrix