isEmpty package:algebraic-graphs

isEmpty :: Graph a -> Bool
algebraic-graphs Algebra.Graph
Check if a graph is empty. Complexity: O(s) time. Good consumer. 
isEmpty empty                       == True
isEmpty (overlay empty empty)       == True
isEmpty (vertex x)                  == False
isEmpty (removeVertex x $ vertex x) == True
isEmpty (removeEdge x y $ edge x y) == False
isEmpty :: AdjacencyMap a -> Bool
algebraic-graphs Algebra.Graph.Acyclic.AdjacencyMap
Check if a graph is empty. Complexity: O(1) time. 
isEmpty empty                             == True
isEmpty (vertex x)                        == False
isEmpty (removeVertex x $ vertex x)       == True
isEmpty (removeEdge 1 2 $ shrink $ 1 * 2) == False
isEmpty :: AdjacencyIntMap -> Bool
algebraic-graphs Algebra.Graph.AdjacencyIntMap
Check if a graph is empty. Complexity: O(1) time. 
isEmpty empty                       == True
isEmpty (overlay empty empty)       == True
isEmpty (vertex x)                  == False
isEmpty (removeVertex x $ vertex x) == True
isEmpty (removeEdge x y $ edge x y) == False
isEmpty :: AdjacencyMap a -> Bool
algebraic-graphs Algebra.Graph.AdjacencyMap
Check if a graph is empty. Complexity: O(1) time. 
isEmpty empty                       == True
isEmpty (overlay empty empty)       == True
isEmpty (vertex x)                  == False
isEmpty (removeVertex x $ vertex x) == True
isEmpty (removeEdge x y $ edge x y) == False
isEmpty :: AdjacencyMap a b -> Bool
algebraic-graphs Algebra.Graph.Bipartite.AdjacencyMap
Check if a graph is empty. Complexity: O(1) time. 
isEmpty empty                 == True
isEmpty (overlay empty empty) == True
isEmpty (vertex x)            == False
isEmpty                       == (==) empty
isEmpty :: Doc s -> Bool
algebraic-graphs Algebra.Graph.Export
Check if a document is empty. The result is the same as when comparing the given document to mempty, but this function does not require the Eq s constraint. Note that the document comprising a single empty string is considered to be different from the empty document. 
isEmpty mempty       == True
isEmpty (literal "") == False
isEmpty x            == (x == mempty)
isEmpty :: Graph e a -> Bool
algebraic-graphs Algebra.Graph.Labelled
Check if a graph is empty. Complexity: O(s) time. 
isEmpty empty                         == True
isEmpty (overlay empty empty)         == True
isEmpty (vertex x)                    == False
isEmpty (removeVertex x $ vertex x)   == True
isEmpty (removeEdge x y $ edge e x y) == False
isEmpty :: AdjacencyMap e a -> Bool
algebraic-graphs Algebra.Graph.Labelled.AdjacencyMap
Check if a graph is empty. Complexity: O(1) time. 
isEmpty empty                         == True
isEmpty (overlay empty empty)         == True
isEmpty (vertex x)                    == False
isEmpty (removeVertex x $ vertex x)   == True
isEmpty (removeEdge x y $ edge e x y) == False
isEmpty :: Relation a -> Bool
algebraic-graphs Algebra.Graph.Relation Algebra.Graph.Relation.Symmetric
Check if a relation is empty. Complexity: O(1) time. 
isEmpty empty                       == True
isEmpty (overlay empty empty)       == True
isEmpty (vertex x)                  == False
isEmpty (removeVertex x $ vertex x) == True
isEmpty (removeEdge x y $ edge x y) == False
isEmpty :: ToGraph t => t -> Bool
algebraic-graphs Algebra.Graph.ToGraph
Check if a graph is empty. 
isEmpty == foldg True (const False) (&&) (&&)
isEmpty :: Graph a -> Bool
algebraic-graphs Algebra.Graph.Undirected
Check if a graph is empty. Complexity: O(s) time. 
isEmpty empty                       == True
isEmpty (overlay empty empty)       == True
isEmpty (vertex x)                  == False
isEmpty (removeVertex x $ vertex x) == True
isEmpty (removeEdge x y $ edge x y) == False