U Ñtœd$ ã@s\ddlmZmZmZddlmZddlmZdd„Z dd„Z dd d „Z ddd„Z dd„Z d S)é)ÚINÚOUTÚarpack_options)Ú Histogram)Ú deprecatedcOst|d<|j||ŽS)z[Returns the in-degrees in a list. See L{GraphBase.degree} for possible arguments. Úmode)rÚdegree©ÚgraphÚargsÚkwds©r úJ/home/sam/Atlas/atlas_env/lib/python3.8/site-packages/igraph/structural.pyÚ _indegree srcOst|d<|j||ŽS)z\Returns the out-degrees in a list. See L{GraphBase.degree} for possible arguments. r)rrr r r rÚ _outdegreesrécOst||j||Žƒ}|S)aCalculates the degree distribution of the graph. Unknown keyword arguments are directly passed to L{GraphBase.degree}. @param bin_width: the bin width of the histogram @return: a histogram representing the degree distribution of the graph. )rr)r Z bin_widthr r Úresultr r rÚ_degree_distributions rNTç333333ë?Úprpackc Cs$|dkr t}| |||dd|||¡S)a¦Calculates the PageRank values of a graph. @param vertices: the indices of the vertices being queried. C{None} means all of the vertices. @param directed: whether to consider directed paths. @param damping: the damping factor. M{1-damping} is the probability of resetting the random walk to a uniform distribution in each step. @param weights: edge weights to be used. Can be a sequence or iterable or even an edge attribute name. @param arpack_options: an L{ARPACKOptions} object used to fine-tune the ARPACK eigenvector calculation. If omitted, the module-level variable called C{arpack_options} is used. This argument is ignored if not the ARPACK implementation is used, see the I{implementation} argument. @param implementation: which implementation to use to solve the PageRank eigenproblem. Possible values are: - C{"prpack"}: use the PRPACK library. This is a new implementation in igraph 0.7 - C{"arpack"}: use the ARPACK library. This implementation was used from version 0.5, until version 0.7. @return: a list with the PageRank values of the specified vertices. N)Údefault_arpack_optionsZpersonalized_pagerank)r ZverticesZdirectedZdampingÚweightsrÚimplementationr r rÚ _pagerank)sørcOstdƒ|j||ŽS)z)Deprecated alias to L{Graph.distances()}.zCGraph.shortest_paths() is deprecated; use Graph.distances() instead)rZ distancesr r r rÚ_shortest_pathsVsr)r)NTrNNr)Zigraph._igraphrrrrZigraph.statisticsrZ igraph.utilsrrrrrrr r r rÚs    ù -