Data.Apart.Structures.Graph

Documentation

type Graph = Cofree Edge

Directed acyclic graph.

data Edge a

Constructors

Empty

Single a

Connect a

Overlay a

Instances

Functor Edge

Methods

fmap :: (a -> b) -> Edge a -> Edge b

(<$) :: a -> Edge b -> Edge a

Foldable Edge

Methods

fold :: Monoid m => Edge m -> m

foldMap :: Monoid m => (a -> m) -> Edge a -> m

foldr :: (a -> b -> b) -> b -> Edge a -> b

foldr' :: (a -> b -> b) -> b -> Edge a -> b

foldl :: (b -> a -> b) -> b -> Edge a -> b

foldl' :: (b -> a -> b) -> b -> Edge a -> b

foldr1 :: (a -> a -> a) -> Edge a -> a

foldl1 :: (a -> a -> a) -> Edge a -> a

toList :: Edge a -> [a]

null :: Edge a -> Bool

length :: Edge a -> Int

elem :: Eq a => a -> Edge a -> Bool

maximum :: Ord a => Edge a -> a

minimum :: Ord a => Edge a -> a

sum :: Num a => Edge a -> a

product :: Num a => Edge a -> a

Traversable Edge

Methods

traverse :: Applicative f => (a -> f b) -> Edge a -> f (Edge b)

sequenceA :: Applicative f => Edge (f a) -> f (Edge a)

mapM :: Monad m => (a -> m b) -> Edge a -> m (Edge b)

sequence :: Monad m => Edge (m a) -> m (Edge a)

Show a => Show (Edge a)

Methods

showsPrec :: Int -> Edge a -> ShowS

show :: Edge a -> String

showList :: [Edge a] -> ShowS

isolated :: Foldable t => t a -> Segment Graph a

star :: Foldable t => a -> t a -> Graph a

remove :: Eq a => a -> Cofree Edge a -> Edge (Cofree Edge a)

Remove vertex and all of its edges.