out package:containers

outdegree :: Graph -> Array Vertex Int
containers Data.Graph
A table of the count of edges from each node.

Examples

outdegree (buildG (0,-1) []) == array (0,-1) []

outdegree (buildG (0,2) [(0,1), (1,2)]) == array (0,2) [(0,1),(1,1),(2,0)]
withoutKeys :: IntMap a -> IntSet -> IntMap a
containers Data.IntMap.Internal Data.IntMap.Lazy Data.IntMap.Strict Data.IntMap.Strict.Internal
Remove all the keys in a given set from a map. 
m `withoutKeys` s = filterWithKey (\k _ -> k `notMember` s) m
withoutKeys :: Ord k => Map k a -> Set k -> Map k a
containers Data.Map.Internal Data.Map.Lazy Data.Map.Strict Data.Map.Strict.Internal
Remove all keys in a Set from a Map. 
m `withoutKeys` s = filterWithKey (\k _ -> k `notMember` s) m
m `withoutKeys` s = m `difference` fromSet (const ()) s