Base exceptions and errors for NetworkX.
Base class for exceptions in NetworkX.
Exception for a serious error in NetworkX
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.
Exception for unexpected termination of algorithms.
Exception raised by algorithms trying to solve a problem instance that has no feasible solution.
Exception for algorithms that should return a path when running on graphs where such a path does not exist.
Exception raised by algorithms trying to solve a maximization or a minimization problem instance that is unbounded.