| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Data.Graph.DGraph.DegreeSequence
Synopsis
- newtype DegreeSequence = DegreeSequence {
- unDegreeSequence :: [(Int, Int)]
Documentation
newtype DegreeSequence Source #
The Degree Sequence of a DGraph is a list of pairs (Indegree, Outdegree)
Constructors
| DegreeSequence | |
Fields
| |
Instances
| Show DegreeSequence Source # | |
Defined in Data.Graph.DGraph.DegreeSequence Methods showsPrec :: Int -> DegreeSequence -> ShowS # show :: DegreeSequence -> String # showList :: [DegreeSequence] -> ShowS # | |
| Eq DegreeSequence Source # | |
Defined in Data.Graph.DGraph.DegreeSequence Methods (==) :: DegreeSequence -> DegreeSequence -> Bool # (/=) :: DegreeSequence -> DegreeSequence -> Bool # | |
| Ord DegreeSequence Source # | |
Defined in Data.Graph.DGraph.DegreeSequence 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 # | |