o h@sdZgdZGdddeZGdddeZGdddeZGdd d eZGd d d eZGd d d eZGdddeZ GdddeZ GdddeZ GdddeZ GdddeZ GdddeZGdddeZGdddeZdS)zL ********** Exceptions ********** Base exceptions and errors for NetworkX. ) HasACycle NodeNotFoundPowerIterationFailedConvergenceExceededMaxIterationsAmbiguousSolutionNetworkXAlgorithmErrorNetworkXException NetworkXErrorNetworkXNoCycleNetworkXNoPathNetworkXNotImplementedNetworkXPointlessConceptNetworkXUnboundedNetworkXUnfeasiblec@eZdZdZdS)rz&Base class for exceptions in NetworkX.N__name__ __module__ __qualname____doc__rrf/var/www/html/construction_image-detection-poc/venv/lib/python3.10/site-packages/networkx/exception.pyrrc@r)rz)Exception for a serious error in NetworkXNrrrrrrrrc@r)r aRaised 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. Nrrrrrr #rr c@r)rz3Exception for unexpected termination of algorithms.Nrrrrrr9rrc@r)rzdException raised by algorithms trying to solve a problem instance that has no feasible solution.Nrrrrrr=rrc@r)r zoException for algorithms that should return a path when running on graphs where such a path does not exist.Nrrrrrr Brr c@r)r zqException for algorithms that should return a cycle when running on graphs where such a cycle does not exist.Nrrrrrr Grr c@r)rz^Raised if a graph has a cycle when an algorithm expects that it will have no cycles. NrrrrrrLrrc@r)r zwException raised by algorithms trying to solve a maximization or a minimization problem instance that is unbounded.Nrrrrrr Srr c@r)r zCException raised by algorithms not implemented for a type of graph.Nrrrrrr Xrr c@r)rz>Exception raised if requested node is not present in the graphNrrrrrr\rrc@r)ra@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. Nrrrrrr`rrc@r)rzRaised 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. Nrrrrrrlrrcs eZdZdZfddZZS)rzRaised 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. cs4d|d}|}tj}|||g|Ri|dS)Nz*power iteration failed to converge within z iterations)super__init__)selfnum_iterationsargskwmsgexception_message superinit __class__rrrs z(PowerIterationFailedConvergence.__init__)rrrrr __classcell__rrr!rrvsrN)r__all__ Exceptionrrr rrr r rr r rrrrrrrrs