easygraph.exception module#

Exceptions#

Base exceptions and errors for EasyGraph.

exception easygraph.exception.EasyGraphAlgorithmError[source]#

Exception for unexpected termination of algorithms.

exception easygraph.exception.EasyGraphError[source]#

Exception for a serious error in EasyGraph

exception easygraph.exception.EasyGraphException[source]#

Bases: Exception

Base class for exceptions in EasyGraph.

exception easygraph.exception.EasyGraphNoCycle[source]#

Exception for algorithms that should return a cycle when running on graphs where such a cycle does not exist.

exception easygraph.exception.EasyGraphNoPath[source]#

Exception for algorithms that should return a path when running on graphs where such a path does not exist.

exception easygraph.exception.EasyGraphNotImplemented[source]#

Exception raised by algorithms not implemented for a type of graph.

exception easygraph.exception.EasyGraphPointlessConcept[source]#

Raised 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.

References

exception easygraph.exception.EasyGraphUnbounded[source]#

Exception raised by algorithms trying to solve a maximization or a minimization problem instance that is unbounded.

exception easygraph.exception.EasyGraphUnfeasible[source]#

Exception raised by algorithms trying to solve a problem instance that has no feasible solution.

exception easygraph.exception.HasACycle[source]#

Raised if a graph has a cycle when an algorithm expects that it will have no cycles.

exception easygraph.exception.NodeNotFound[source]#

Exception raised if requested node is not present in the graph