Data.Graph.UGraph

UGraph data type

data UGraph v e

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

Instances

Graph UGraph

Defined in Data.Graph.UGraph

Methods

empty :: Hashable v => UGraph v e

order :: UGraph v e -> Int

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

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

vertices :: UGraph v e -> [v]

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

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]

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

(Hashable v, Eq v) => Functor (UGraph v)

Defined in Data.Graph.UGraph

Methods

fmap :: (a -> b) -> UGraph v a -> UGraph v b

(<$) :: a -> UGraph v b -> UGraph v a

(Hashable v, Eq v) => Foldable (UGraph v)

Defined in Data.Graph.UGraph

Methods

fold :: Monoid m => UGraph v m -> m

foldMap :: Monoid m => (a -> m) -> UGraph v a -> m

foldr :: (a -> b -> b) -> b -> UGraph v a -> b

foldr' :: (a -> b -> b) -> b -> UGraph v a -> b

foldl :: (b -> a -> b) -> b -> UGraph v a -> b

foldl' :: (b -> a -> b) -> b -> UGraph v a -> b

foldr1 :: (a -> a -> a) -> UGraph v a -> a

foldl1 :: (a -> a -> a) -> UGraph v a -> a

toList :: UGraph v a -> [a]

null :: UGraph v a -> Bool

length :: UGraph v a -> Int

elem :: Eq a => a -> UGraph v a -> Bool

maximum :: Ord a => UGraph v a -> a

minimum :: Ord a => UGraph v a -> a

sum :: Num a => UGraph v a -> a

product :: Num a => UGraph v a -> a

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

Defined in Data.Graph.UGraph

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)

Defined in Data.Graph.UGraph

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)

Defined in Data.Graph.UGraph

Methods

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

show :: UGraph v e -> String

showList :: [UGraph v e] -> ShowS

Generic (UGraph v e)

Defined in Data.Graph.UGraph

Associated Types

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

Methods

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

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

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

Defined in Data.Graph.UGraph

Methods

(<>) :: UGraph v e -> UGraph v e -> UGraph v e

sconcat :: NonEmpty (UGraph v e) -> UGraph v e

stimes :: Integral b => b -> UGraph v e -> UGraph v e

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

Defined in Data.Graph.UGraph

Methods

mempty :: UGraph v e

mappend :: UGraph v e -> UGraph v e -> UGraph v e

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

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

Defined in Data.Graph.UGraph

Methods

arbitrary :: Gen (UGraph v e)

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

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

Defined in Data.Graph.UGraph

Methods

rnf :: UGraph v e -> ()

type Rep (UGraph v e)

Defined in Data.Graph.UGraph

type Rep (UGraph v e)

Functions on UGraph

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

Insert an undirected Edge into a UGraph

The involved vertices are inserted if they don't exist. If the graph already contains the Edge, its attribute gets updated

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

Same as insertEdge but for a list of Edges

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

Remove the undirected Edge from a UGraph if present. The involved vertices are left untouched

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

Same as removeEdge but for a list of Edges

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

Remove the undirected Edge from a UGraph if present. The involved vertices also get removed

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

Retrieve the Edges of a UGraph

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

Tell if an undirected Edge exists in the graph

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

Retrieve the incident Edges of a Vertex

List conversions

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

Convert a UGraph to a list of Edges discarding isolated vertices

Note that because toEdgesList discards isolated vertices: > fromEdgesList . toEdgesList /= id

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

Construct a UGraph from a list of Edges

Pretty printing

prettyPrint :: (Hashable v, Eq v, Show v, Show e) => UGraph v e -> String

Pretty print a UGraph