graphite-0.9.2.0: Graphs and networks library

Safe HaskellSafe
LanguageHaskell2010

Data.Graph.UGraph.DegreeSequence

Synopsis

Documentation

degreeSequence :: [Int] -> DegreeSequence Source #

Construct a DegreeSequence from a list of degrees | Negative degree values are discarded

getDegreeSequence :: (Hashable v, Eq v) => UGraph v e -> Maybe DegreeSequence Source #

Get the DegreeSequence of a simple UGraph | If the graph is not simple (see isSimple) the result is Nothing

isGraphicalSequence :: DegreeSequence -> Bool Source #

Tell if a DegreeSequence is a Graphical Sequence | A Degree Sequence is a Graphical Sequence if a corresponding UGraph for | it exists. | Use the Havel-Hakimi algorithm

isDirectedGraphic :: DegreeSequence -> Bool Source #

Tell if a DegreeSequence is a Directed Graphic | A Directed Graphic is a Degree Sequence for wich a DGraph exists TODO: Kleitman–Wang | Fulkerson–Chen–Anstee theorem algorithms

holdsHandshakingLemma :: DegreeSequence -> Bool Source #

Tell if a DegreeSequence holds the Handshaking lemma, that is, if the | number of vertices with odd degree is even

fromGraphicalSequence :: DegreeSequence -> Maybe (UGraph Int ()) Source #

Get the corresponding UGraph of a DegreeSequence | If the DegreeSequence is not graphical (see isGraphicalSequence) the | result is Nothing