MIT网络分析工具.doc

《MIT网络分析工具.doc》由会员上传分享，免费在线阅读，更多相关内容在工程资料-天天文库。

1、ArchivedVersion(frozenNov.2011)Thecodeisclassifiedbyfunctionalityasfollows(121routinestotal,lastversionNov6,2011).Allfunctionscanbedownloadedhere.Basicnetworkroutines(17)•getNodes.m-returnthelistofnodesforvaryinggraphrepresentations;•getEdges.m-returnthelistofedgesforvaryinggraph

2、representations;•numnodes.m-numberofvertices/nodesinthenetwork;•numedges.m-numberofedges/linksinthenetwork;•linkdensitv.m-thedensityoflinksofthegraph;•selflooDS.m-numberofselfloops,i.e・nodesconnectedtothemselves;•multiedges.m-numberofarcs(i,j)withmultipleedgesacrossthem;•averaged

3、egree.m-theaveragedegree(#links)acrossallnodes;•numconncomp.m-numberofconnectedcomponents(usingalgebraiccormectivity);•findconncomp.m-thenumberofconnectedcomponentsinanundirectedgraph;•giantcomponent.m-extractthegiantcomponentonly(undirectedgraph);•tarian.m・findthestronglyconnect

4、edcomponentsinadirectedgraph;•graphcomplement.m-thecomplementgraph;•graphdual.m-thegraphdual(orlinegraph,adjointgraph);•subgraph,m-returnthesubgraphadjacencygiventhegraphandthesubgraphnodes;•leafnodes.m-nodesconnectedtoonlyoneothernode;•leafedges.m-edgeswithonlyoneadjacentedge;Di

5、agnostics(11)•issimple.m-checkwhetherthegraphhasselfloopsandmultipleedges;•isdirected.m-directedorundirectedgraph(rightnowusesissymmetric.m);•issymmetric.m-checkwhetheramatrixissymmetric;•isconnected.m-checkwhetheragraphisconnected;•isweighted.m-determinewhetherthegraphhasweighte

6、dlinks;•isregular.m-checkwhetherit'saregulargraph;•iscomDlete.m-checkwhetherthegraphiscomplete;•iseuleriari.m-findoutwhetherit'saneuleriangraph;•istree.m・checkwhetherthegraphisatree;•isgraphic.m-checkwhetherasequenceofnumbersisgraphic;•isbipartite.m-checkwhetheragraphisbipartite;

7、Conversionroutines(14)•adi2adiLm(adiL2adj,m)-convertanadjacencymatrixtoanadjacencylist;•adi2edgeLm(edqeL2adi.m)・convertanadjacencymatrixtoanedgelist;•adi2inc.m,(inc2adi.m)-convertadjacencymatrixtoincidencematrixandvice-versa;•adj2strm(str2adj.m)-convertadjacencymatrixtoastringgra

8、phrepresentation;•adjL2edgeL.m,(edgeL2ad