Safe Haskell	Safe
Language	Haskell2010

Data.Graph.DGraph.DegreeSequence

Synopsis

Documentation

The Degree Sequence of a DGraph is a list of pairs (Indegree, Outdegree)

Constructors

DegreeSequence
Fields unDegreeSequence :: [(Int, Int)]

Instances

Eq DegreeSequence Source #
Methods (==) :: DegreeSequence -> DegreeSequence -> Bool # (/=) :: DegreeSequence -> DegreeSequence -> Bool #
Ord DegreeSequence Source #
Methods compare :: DegreeSequence -> DegreeSequence -> Ordering # (<) :: DegreeSequence -> DegreeSequence -> Bool # (<=) :: DegreeSequence -> DegreeSequence -> Bool # (>) :: DegreeSequence -> DegreeSequence -> Bool # (>=) :: DegreeSequence -> DegreeSequence -> Bool # max :: DegreeSequence -> DegreeSequence -> DegreeSequence # min :: DegreeSequence -> DegreeSequence -> DegreeSequence #
Show DegreeSequence Source #
Methods showsPrec :: Int -> DegreeSequence -> ShowS # show :: DegreeSequence -> String # showList :: [DegreeSequence] -> ShowS #