/usr/lib/hugs/packages/fgl/Data/Graph/Inductive/Monad.hs is in libhugs-fgl-bundled 98.200609.21-5.3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 | -- (c) 2002 by Martin Erwig [see file COPYRIGHT]
-- | Monadic Graphs
module Data.Graph.Inductive.Monad(
-- * Classes
GraphM(..),
-- * Operations
-- ** Graph Folds and Maps
ufoldM,
-- ** Graph Projection
nodesM,edgesM,newNodesM,
-- ** Graph Construction and Destruction
delNodeM,delNodesM,
mkUGraphM,
-- ** Graph Inspection
contextM,labM
) where
import Data.Graph.Inductive.Graph
----------------------------------------------------------------------
-- MONADIC GRAPH CLASS
----------------------------------------------------------------------
--
-- Currently, we define just one monadic graph class:
--
-- GraphM: static, decomposable graphs
-- static means that a graph itself cannot be changed
--
-- Later we might also define DynGraphM for dynamic, extensible graphs
--
-- Monadic Graph
--
class Monad m => GraphM m gr where
-- essential operations
emptyM :: m (gr a b)
isEmptyM :: m (gr a b) -> m Bool
matchM :: Node -> m (gr a b) -> m (Decomp gr a b)
mkGraphM :: [LNode a] -> [LEdge b] -> m (gr a b)
labNodesM :: m (gr a b) -> m [LNode a]
-- derived operations
matchAnyM :: m (gr a b) -> m (GDecomp gr a b)
noNodesM :: m (gr a b) -> m Int
nodeRangeM :: m (gr a b) -> m (Node,Node)
labEdgesM :: m (gr a b) -> m [LEdge b]
-- default implementation of derived operations
matchAnyM g = do vs <- labNodesM g
case vs of
[] -> error "Match Exception, Empty Graph"
(v,_):_ -> do (Just c,g') <- matchM v g
return (c,g')
noNodesM = labNodesM >>. length
nodeRangeM g = do vs <- labNodesM g
let vs' = map fst vs
return (minimum vs',maximum vs')
labEdgesM = ufoldM (\(p,v,_,s)->(((map (i v) p)++(map (o v) s))++)) []
where o v = \(l,w)->(v,w,l)
i v = \(l,w)->(w,v,l)
-- composing a monadic function with a non-monadic one
--
(>>.) :: Monad m => (m a -> m b) -> (b -> c) -> (m a -> m c)
f >>. g = (>>= return . g) . f
----------------------------------------------------------------------
-- DERIVED GRAPH OPERATIONS
----------------------------------------------------------------------
-- graph folds and maps
--
-- | graph fold
ufoldM :: GraphM m gr => ((Context a b) -> c -> c) -> c -> m (gr a b) -> m c
ufoldM f u g = do b <- isEmptyM g
if b then return u
else do (c,g') <- matchAnyM g
x <- ufoldM f u (return g')
return (f c x)
-- (additional) graph projection
-- [noNodes, nodeRange, labNodes, labEdges are defined in class Graph]
--
nodesM :: GraphM m gr => m (gr a b) -> m [Node]
nodesM = labNodesM >>. map fst
edgesM :: GraphM m gr => m (gr a b) -> m [Edge]
edgesM = labEdgesM >>. map (\(v,w,_)->(v,w))
newNodesM :: GraphM m gr => Int -> m (gr a b) -> m [Node]
newNodesM i g = do (_,n) <- nodeRangeM g
return [n+1..n+i]
-- graph construction & destruction
--
delNodeM :: GraphM m gr => Node -> m (gr a b) -> m (gr a b)
delNodeM v = delNodesM [v]
delNodesM :: GraphM m gr => [Node] -> m (gr a b) -> m (gr a b)
delNodesM [] g = g
delNodesM (v:vs) g = do (_,g') <- matchM v g
delNodesM vs (return g')
mkUGraphM :: GraphM m gr => [Node] -> [Edge] -> m (gr () ())
mkUGraphM vs es = mkGraphM (labUNodes vs) (labUEdges es)
labUEdges = map (\(v,w)->(v,w,()))
labUNodes = map (\v->(v,()))
-- graph inspection (for a particular node)
--
onMatch :: GraphM m gr => (Context a b -> c) -> c -> m (gr a b) -> Node -> m c
onMatch f u g v = do (x,_) <- matchM v g
return (case x of {Nothing -> u; Just c -> f c})
contextM :: GraphM m gr => m (gr a b) -> Node -> m (Context a b)
contextM g v = onMatch id (error ("Match Exception, Node: "++show v)) g v
labM :: GraphM m gr => m (gr a b) -> Node -> m (Maybe a)
labM = onMatch (Just . lab') Nothing
{-
neighbors :: GraphM m gr => m (gr a b) -> Node -> [Node]
neighbors = (\(p,_,_,s) -> map snd (p++s)) .: context
suc :: GraphM m gr => m (gr a b) -> Node -> [Node]
suc = map snd .: context4
pre :: GraphM m gr => m (gr a b) -> Node -> [Node]
pre = map snd .: context1
lsuc :: GraphM m gr => m (gr a b) -> Node -> [(Node,b)]
lsuc = map flip2 .: context4
lpre :: GraphM m gr => m (gr a b) -> Node -> [(Node,b)]
lpre = map flip2 .: context1
out :: GraphM m gr => m (gr a b) -> Node -> [LEdge b]
out g v = map (\(l,w)->(v,w,l)) (context4 g v)
inn :: GraphM m gr => m (gr a b) -> Node -> [LEdge b]
inn g v = map (\(l,w)->(w,v,l)) (context1 g v)
outdeg :: GraphM m gr => m (gr a b) -> Node -> Int
outdeg = length .: context4
indeg :: GraphM m gr => m (gr a b) -> Node -> Int
indeg = length .: context1
deg :: GraphM m gr => m (gr a b) -> Node -> Int
deg = (\(p,_,_,s) -> length p+length s) .: context
--
-- -- context inspection
-- --
-- node' :: Context a b -> Node
-- node' (_,v,_,_) = v
--
-- lab' :: Context a b -> a
-- lab' (_,_,l,_) = l
--
-- labNode' :: Context a b -> LNode a
-- labNode' (_,v,l,_) = (v,l)
--
-- neighbors' :: Context a b -> [Node]
-- neighbors' (p,_,_,s) = map snd p++map snd s
--
-- suc' :: Context a b -> [Node]
-- suc' (_,_,_,s) = map snd s
--
-- pre' :: Context a b -> [Node]
-- pre' (p,_,_,_) = map snd p
--
-- lpre' :: Context a b -> [(Node,b)]
-- lpre' (p,_,_,_) = map flip2 p
--
-- lsuc' :: Context a b -> [(Node,b)]
-- lsuc' (_,_,_,s) = map flip2 s
--
-- out' :: Context a b -> [LEdge b]
-- out' (_,v,_,s) = map (\(l,w)->(v,w,l)) s
--
-- inn' :: Context a b -> [LEdge b]
-- inn' (p,v,_,_) = map (\(l,w)->(w,v,l)) p
--
-- outdeg' :: Context a b -> Int
-- outdeg' (_,_,_,s) = length s
--
-- indeg' :: Context a b -> Int
-- indeg' (p,_,_,_) = length p
--
-- deg' :: Context a b -> Int
-- deg' (p,_,_,s) = length p+length s
-- graph equality
--
nodeComp :: Eq b => LNode b -> LNode b -> Ordering
nodeComp n@(v,a) n'@(w,b) | n == n' = EQ
| v<w = LT
| otherwise = GT
slabNodes :: (Eq a,Graph gr) => m (gr a b) -> [LNode a]
slabNodes = sortBy nodeComp . labNodes
edgeComp :: Eq b => LEdge b -> LEdge b -> Ordering
edgeComp e@(v,w,a) e'@(x,y,b) | e == e' = EQ
| v<x || (v==x && w<y) = LT
| otherwise = GT
slabEdges :: (Eq b,Graph gr) => m (gr a b) -> [LEdge b]
slabEdges = sortBy edgeComp . labEdges
instance (Eq a,Eq b,Graph gr) => Eq (m (gr a b)) where
g == g' = slabNodes g == slabNodes g' && slabEdges g == slabEdges g'
-}
|