MIT网络分析工具

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

1、ArchivedVersion(frozenNov.2011)Thecodeisclassifiedbyfunctionalityasfollows(121routinestotal,lastversionNov6,2011).Allfunctionscanbedownloadedhere.Basicnetworkroutines(17)•getNodes.m•returnthelistofnodesforvaryinggraphrepresentations;•qetEdqes.m・returnthelistofedgesforvaryinggraphrepresentations;•

2、numnodes.m-numberofvertices/nodesinthenetwork;•numedges.m-numberofedges/linksinthenetwork;•linkdensitv.m・thedensityoflinksofthegraph;•selflooDS.m・numberofselfloops,i.e・nodesconnectedtothemselves;•multiedqes.m・numberofarcs(ij)withmultipleedgesacrossthem;•averagedeqree.m-theaveragedegree(#links)acr

3、ossallnodes;•numconncomp.m・numberofconnectedcomponents(usingalgebraicconnectivity);•findconncomp.m・thenumberofconnectedcomponentsinanundirectedgraph;•giantcomponent.m・extractthegiantcomponentonly(undirectedgraph);•tarian.m-findthestronglyconnectedcomponentsinadirectedgraph;•qraphcomplements・theco

4、mplementgraph;•graphdual.m-thegraphdual(orlinegraph,adjointgraph);•subgraph.m-returnthesubgraphadjacencygiventhegraphandthesubgraphnodes;•leafnodes.m・nodesconnectedtoonlyoneothernode;•leafedqes.m・edgeswithonlyoneadjacentedge;Diagnostics(11)•issimple.m-checkwhetherthegraphhasselfloopsandmultipleed

5、ges;•isdirected.m・directedorundirectedgraph(rightnowusesissymmetric.m);•issvmmetric.m-checkwhetheramatrixissymmetric;•isconnected.m-checkwhetheragraphisconnected;•isweighted.m-determinewhetherthegraphhasweightedlinks;•isregular.m-checkwhetherit'saregulargraph;•iscomplete.m・checkwhetherthegraphisc

6、omplete;•iseuleriarum・findoutwhetherit'saneuleriangraph;•istree.m-checkwhetherthegraphisatree;•isqraphic.m-checkwhetherasequeneeofnumbersisgraphic;•isbipartite.m・checkwhetheragraphisbipartite;Conversionroutines(14)•adi2adiL・m,(adiL2adi.m)-convertanadjacencymatrixtoanadjacencylist;•adi2edqeLm(edge

7、L2adj.m)-convertanadjacencymatrixtoanedgelist;•adi2inc.m,(inc2adj.m)-convertadjacencymatrixtoincidencematrixandvice-versa;•adi2str.m,(str2adj.m)-convertadjacencymatrixtoastringgraphrepresentation;•adjL2edgeLm(edgeL2adi