python中igraph包说明v0.6.5

NAMEigraph-IGraphlibrary.DESCRIPTION@undocumented:deprecated,_graphmethod,_add_proxy_methods,_layout_method_wrapper,_3d_version_forPACKAGECONTENTS_igraphapp(package)clusteringcompatconfigurationcutdatatypesdrawing(package)formulalayoutmatchingnexusremote(package)statisticssummarytest(package)utilsvendor(package)CLASSESbuiltins.objectARPACKOptionsBFSIterEdgeGraphGraphVertexigraph.core.EdgeSeq(builtins.object)EdgeSeqigraph.core.VertexSeq(builtins.object)VertexSeqclassARPACKOptions(builtins.object)|ClassrepresentingtheparametersoftheARPACKmodule.||ARPACKisaFortranimplementationoftheimplicitlyrestarted|Arnoldimethod,analgorithmforcalculatingsomeofthe|eigenvaluesandeigenvectorsofagivenmatrix.igraphusesthis|packageoccasionally,andthisclasscanbeusedtofine-tunethe|behaviourofARPACKinsuchcases.||Theclasshasseveralattributeswhicharenotdocumentedhere,|sincetheyareusuallyofmarginalusetotheordinaryuser.|SeethesourcecodeoftheoriginalARPACKFortranpackage|(especiallythefileC{dsaupd.f})foradetailedexplanationofthe|parameters.Onlythemostbasicattributesareexplainedhere.Most|ofthemarereadonlyunlessstatedotherwise.||-C{bmat}:typeoftheeigenproblemsolved.C{'I'}meansstandard|eigenproblem(A*x=lambda*x),C{'G'}meansgeneralized|eigenproblem(A*x=lambda*B*x).||-C{n}:dimensionoftheeigenproblem||-C{tol}:precision.Iflessthanorequaltozero,thestandard|machineprecisionisusedascomputedbytheLAPACKutility|calledC{dlamch}.Thiscanbemodified.||-C{mxiter}:maximumnumberofupdateiterationstotake.This|canbemodified.YoucanalsouseC{maxiter}.||-C{iter}:actualnumberofupdateiterationstaken||-C{numop}:totalnumberofOP*xoperations||-C{numopb}:totalnumberofB*xoperationsifC{bmat}isC{'G'}||-C{numreo}:totalnumberofstepsofre-orthogonalization||Methodsdefinedhere:||__str__(...)|x.__str__()==str(x)||----------------------------------------------------------------------|Dataandotherattributesdefinedhere:||__new__=built-inmethod__new__oftypeobject|T.__new__(S,...)-anewobjectwithtypeS,asubtypeofTclassBFSIter(builtins.object)|igraphBFSiteratorobject||Methodsdefinedhere:||__iter__(...)|x.__iter__()==iter(x)||__next__(...)|x.__next__()==next(x)classEdge(builtins.object)|Classrepresentingasingleedgeinagraph.||Theedgeisreferencedbyitsindex,soiftheunderlyinggraph|changes,thesemanticsoftheedgeobjectmightchangeaswell|(iftheedgeindicesarealteredintheoriginalgraph).||Theattributesoftheedgecanbeaccessedbyusingtheedge|asahash:||e[weight]=2#doctest:+SKIP|printe[weight]#doctest:+SKIP|2||Methodsdefinedhere:||__delitem__(...)|x.__delitem__(y)==delx[y]||__getitem__(...)|x.__getitem__(y)==x[y]||__len__(...)|x.__len__()==len(x)||__repr__(...)|x.__repr__()==repr(x)||__setitem__(...)|x.__setitem__(i,y)==x[i]=y||attribute_names(...)|attribute_names()-list||Returnsthelistofedgeattributenames||attributes(...)|attributes()-dict||Returnsadictofattributenamesandvaluesfortheedge||count_multiple(...)|ProxymethodtoL{Graph.count_multiple()}||Thismethodcallsthecount_multiplemethodoftheL{Graph}classwiththisedgeasthefirstargument,andreturnstheresult.||@see:Graph.count_multiple()fordetails.||delete(...)|ProxymethodtoL{Graph.delete_edges()}||Thismethodcallsthedelete_edgesmethodoftheL{Graph}classwiththisedgeasthefirstargument,andreturnstheresult.||@see:Graph.delete_edges()fordetails.||is_loop(...)|ProxymethodtoL{Graph.is_loop()}||Thismethodcallstheis_loopmethodoftheL{Graph}classwiththisedgeasthefirstargument,andreturnstheresult.||@see:Graph.is_loop()fordetails.||is_multiple(...)|ProxymethodtoL{Graph.is_multiple()}||Thismethodcallstheis_multiplemethodoftheL{Graph}classwiththisedgeasthefirstargument,andreturnstheresult.||@see:Graph.is_multiple()fordetails.||is_mutual(...)|ProxymethodtoL{Graph.is_mutual()}||Thismethodcallstheis_mutualmethodoftheL{Graph}classwiththisedgeasthefirstargument,andreturnstheresult.||@see:Graph.is_mutual()fordetails.||update_attributes(...)|update_attributes(E,**F)-None||Updatestheattributesoftheedgefromdict/iterableEandF.||IfEhasaC{keys()}method,itdoes:C{forkinE:self[k]=E[k]}.|IfElacksaC{keys()}method,itdoes:C{for(k,v)inE:self[k]=v}.|Ineithercase,thisisfollowedby:C{forkinF:self[k]=F[k]}.||ThismethodthusbehavessimilarlytotheC{update()}methodofPython|dictionaries.||----------------------------------------------------------------------|Datadescriptorsdefinedhere:||index|Indexofthisedge||source|Sourcenodeindexofthisedge||target|Targetnodeindexofthisedge||tuple|SourceandtargetnodeindexofthisedgeasatupleclassEdgeSeq(igraph.core.EdgeSeq)|Classrepresentingasequenceofedgesinthegraph.||ThisclassismosteasilyaccessedbytheC{es}fieldofthe|L{Graph}object,whichreturnsanorderedsequenceofalledgesin|thegraph.Theedgesequencecanberefinedbyinvokingthe|L{EdgeSeq.select()}method.L{EdgeSeq.select()}canalsobe|accessedbysimplycallingtheL{EdgeSeq}object.||Analternativewaytocreateanedgesequencereferringtoagiven|graphistousetheconstructordirectly:||g=Graph.Full(3)|es=EdgeSeq(g)|restricted_es=EdgeSeq(g,[0,1])||Theindividualedgescanbeaccessedbyindexingtheedgesequence|object.Itca