blob: 0cd2e7e315489889018dd81a674a3f85198588bc (
plain)
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
|
module ProofGraph (
Node(..),
Graph(..),
empty,
insert,
delete,
union
) where
import Data.Set( Set )
import qualified Data.Set as Set
data Node a = Node { contents :: a
, successors :: Set (Node a) } deriving (Eq, Ord, Show)
data Graph a = Graph { nodes :: Set (Node a) } deriving (Show)
empty :: Graph a
empty = Graph Set.empty
insert :: Ord a => Node a -> Graph a -> Graph a
insert node graph = Graph (Set.insert node (nodes graph))
delete :: Ord a => Node a -> Graph a -> Graph a
delete node graph = Graph (Set.delete node (nodes graph))
union :: Ord a => Set (Node a) -> Graph a -> Graph a
union nodeSet graph = Graph (Set.union nodeSet (nodes graph))
|
