Data.Graph.UGraph

Documentation

newtype UGraph v e

Undirected Graph of Vertices in v and Edges with attributes in e

Constructors

UGraph

Fields

• unUGraph :: HashMap v (Links v e)

Instances

Graph UGraph

Methods

empty :: Hashable v => UGraph v e

order :: UGraph v e -> Int

size :: (Hashable v, Eq v) => UGraph v e -> Int

vertices :: UGraph v e -> [v]

edgePairs :: (Hashable v, Eq v) => UGraph v e -> [(v, v)]

containsVertex :: (Hashable v, Eq v) => UGraph v e -> v -> Bool

areAdjacent :: (Hashable v, Eq v) => UGraph v e -> v -> v -> Bool

adjacentVertices :: (Hashable v, Eq v) => UGraph v e -> v -> [v]

directlyReachableVertices :: (Hashable v, Eq v) => UGraph v e -> v -> [v]

vertexDegree :: (Hashable v, Eq v) => UGraph v e -> v -> Int

degrees :: (Hashable v, Eq v) => UGraph v e -> [Int]

maxDegree :: (Hashable v, Eq v) => UGraph v e -> Int

minDegree :: (Hashable v, Eq v) => UGraph v e -> Int

avgDegree :: (Hashable v, Eq v) => UGraph v e -> Double

density :: (Hashable v, Eq v) => UGraph v e -> Double

insertVertex :: (Hashable v, Eq v) => v -> UGraph v e -> UGraph v e

insertVertices :: (Hashable v, Eq v) => [v] -> UGraph v e -> UGraph v e

containsEdgePair :: (Hashable v, Eq v) => UGraph v e -> (v, v) -> Bool

incidentEdgePairs :: (Hashable v, Eq v) => UGraph v e -> v -> [(v, v)]

insertEdgePair :: (Hashable v, Eq v) => (v, v) -> UGraph v () -> UGraph v ()

insertEdgePairs :: (Hashable v, Eq v) => [(v, v)] -> UGraph v () -> UGraph v ()

removeVertex :: (Hashable v, Eq v) => v -> UGraph v e -> UGraph v e

removeVertices :: (Hashable v, Eq v) => [v] -> UGraph v e -> UGraph v e

removeEdgePair :: (Hashable v, Eq v) => (v, v) -> UGraph v e -> UGraph v e

removeEdgePairs :: (Hashable v, Eq v) => [(v, v)] -> UGraph v e -> UGraph v e

removeEdgePairAndVertices :: (Hashable v, Eq v) => (v, v) -> UGraph v e -> UGraph v e

isSimple :: (Hashable v, Eq v) => UGraph v e -> Bool

fromAdjacencyMatrix :: [[Int]] -> Maybe (UGraph Int ())

toAdjacencyMatrix :: UGraph v e -> [[Int]]

(Eq e, Eq v) => Eq (UGraph v e)

Methods

(==) :: UGraph v e -> UGraph v e -> Bool

(/=) :: UGraph v e -> UGraph v e -> Bool

(Hashable v, Eq v, Read v, Read e) => Read (UGraph v e)

Methods

readsPrec :: Int -> ReadS (UGraph v e)

readList :: ReadS [UGraph v e]

readPrec :: ReadPrec (UGraph v e)

readListPrec :: ReadPrec [UGraph v e]

(Hashable v, Eq v, Show v, Show e) => Show (UGraph v e)

Methods

showsPrec :: Int -> UGraph v e -> ShowS

show :: UGraph v e -> String

showList :: [UGraph v e] -> ShowS

Generic (UGraph v e)

Associated Types

type Rep (UGraph v e) :: * -> *

Methods

from :: UGraph v e -> Rep (UGraph v e) x

to :: Rep (UGraph v e) x -> UGraph v e

(Arbitrary v, Arbitrary e, Hashable v, Num v, Ord v) => Arbitrary (UGraph v e)

Methods

arbitrary :: Gen (UGraph v e)

shrink :: UGraph v e -> [UGraph v e]

(NFData v, NFData e) => NFData (UGraph v e)

Methods

rnf :: UGraph v e -> ()

type Rep (UGraph v e)

type Rep (UGraph v e) = D1 (MetaData "UGraph" "Data.Graph.UGraph" "graphite-0.5.0.0-5I7pH1sVUJTG7Ml6swiWg4" True) (C1 (MetaCons "UGraph" PrefixI True) (S1 (MetaSel (Just Symbol "unUGraph") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (HashMap v (Links v e)))))

insertEdge :: (Hashable v, Eq v) => Edge v e -> UGraph v e -> UGraph v e

O(log n) Insert an undirected Edge into a UGraph | The involved vertices are inserted if don't exist. If the graph already | contains the Edge, its attribute is updated

insertEdges :: (Hashable v, Eq v) => [Edge v e] -> UGraph v e -> UGraph v e

O(m*log n) Insert many directed Edges into a UGraph | Same rules as insertEdge are applied

removeEdge :: (Hashable v, Eq v) => Edge v e -> UGraph v e -> UGraph v e

O(log n) Remove the undirected Edge from a UGraph if present | The involved vertices are left untouched

removeEdge' :: (Hashable v, Eq v) => (v, v) -> UGraph v e -> UGraph v e

Same as removeEdge but the edge is an unordered pair

removeEdgeAndVertices :: (Hashable v, Eq v) => Edge v e -> UGraph v e -> UGraph v e

O(log n) Remove the undirected Edge from a UGraph if present | The involved vertices are also removed

edges :: forall v e. (Hashable v, Eq v) => UGraph v e -> [Edge v e]

O(n*m) Retrieve the Edges of a UGraph

containsEdge :: (Hashable v, Eq v) => UGraph v e -> Edge v e -> Bool

O(log n) Tell if an undirected Edge exists in the graph

containsEdge' :: (Hashable v, Eq v) => UGraph v e -> (v, v) -> Bool

Same as containsEdge but the edge is an unordered pair

incidentEdges :: (Hashable v, Eq v) => UGraph v e -> v -> [Edge v e]

Retrieve the incident Edges of a Vertex

Lists

toList :: (Hashable v, Eq v) => UGraph v e -> [Edge v e]

Convert a UGraph to a list of Edges | Same as edges

fromList :: (Hashable v, Eq v) => [Edge v e] -> UGraph v e

Construct a UGraph from a list of Edges