hDSr/SQr"SS\5r"SS\5r"SS\5r"SS \5r"S S \5r"S S \5r"SS\5r "SS\5r "SS\5r "SS\5r "SS\5r "SS\5r"SS\5r"SS\5rg)zL ********** Exceptions ********** Base exceptions and errors for NetworkX. ) HasACycle NodeNotFoundPowerIterationFailedConvergenceExceededMaxIterationsAmbiguousSolutionNetworkXAlgorithmErrorNetworkXException NetworkXErrorNetworkXNoCycleNetworkXNoPathNetworkXNotImplementedNetworkXPointlessConceptNetworkXUnboundedNetworkXUnfeasiblec\rSrSrSrSrg)rz&Base class for exceptions in NetworkX.N__name__ __module__ __qualname____firstlineno____doc____static_attributes__rD/var/www/html/env/lib/python3.13/site-packages/networkx/exception.pyrrs0rrc\rSrSrSrSrg)r z)Exception for a serious error in NetworkXrNrrrrr r s3rr c\rSrSrSrSrg)r #aiRaised when a null graph is provided as input to an algorithm that cannot use it. The null graph is sometimes considered a pointless concept [1]_, thus the name of the exception. Notes ----- Null graphs and empty graphs are often used interchangeably but they are well defined in NetworkX. An ``empty_graph`` is a graph with ``n`` nodes and 0 edges, and a ``null_graph`` is a graph with 0 nodes and 0 edges. References ---------- .. [1] Harary, F. and Read, R. "Is the Null Graph a Pointless Concept?" In Graphs and Combinatorics Conference, George Washington University. New York: Springer-Verlag, 1973. rNrrrrr r #srr c\rSrSrSrSrg)r9z3Exception for unexpected termination of algorithms.rNrrrrrr9s=rrc\rSrSrSrSrg)r=z`Exception raised by algorithms trying to solve a problem instance that has no feasible solution.rNrrrrrr=s/rrc\rSrSrSrSrg)r BzkException for algorithms that should return a path when running on graphs where such a path does not exist.rNrrrrr r Bs3rr c\rSrSrSrSrg)r GzmException for algorithms that should return a cycle when running on graphs where such a cycle does not exist.rNrrrrr r Gs4rr c\rSrSrSrSrg)rLzVRaised if a graph has a cycle when an algorithm expects that it will have no cycles. rNrrrrrrLsrrc\rSrSrSrSrg)rSzsException raised by algorithms trying to solve a maximization or a minimization problem instance that is unbounded.rNrrrrrrSs=rrc\rSrSrSrSrg)r XzCException raised by algorithms not implemented for a type of graph.rNrrrrr r XsMrr c\rSrSrSrSrg)r\z>Exception raised if requested node is not present in the graphrNrrrrrr\sHrrc\rSrSrSrSrg)r`a(Raised if more than one valid solution exists for an intermediary step of an algorithm. In the face of ambiguity, refuse the temptation to guess. This may occur, for example, when trying to determine the bipartite node sets in a disconnected bipartite graph when computing bipartite matchings. rNrrrrrr`srrc\rSrSrSrSrg)rlzRaised if a loop iterates too many times without breaking. This may occur, for example, in an algorithm that computes progressively better approximations to a value but exceeds an iteration bound specified by the user. rNrrrrrrlsrrc,^\rSrSrSrU4SjrSrU=r$)rvzRaised when the power iteration method fails to converge within a specified iteration limit. `num_iterations` is the number of iterations that have been completed when this exception was raised. cB>SUS3nUn[TU]nU"X/UQ70UD6 g)Nz*power iteration failed to converge within z iterations)super__init__)selfnum_iterationsargskwmsgexception_message superinit __class__s rr8(PowerIterationFailedConvergence.__init__s4:>:J+VG$ $7D7B7rr)rrrrrr8r __classcell__)r@s@rrrvs88rrN)r__all__ Exceptionrr r rrr r rrr rrrrrrrrEs $1 14%40,>.>/// 3'3 4(4 !=.= N.NI$I ) - 8&; 8r