Data.Apart.Structures.Graph

Documentation

type Graph = Cofree Edges

Directed acyclic graph.

data Edges a

Constructors

Empty

Connect a

Overlay a

Instances

Functor Edges

Defined in Data.Apart.Structures.Graph

Methods

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

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

Foldable Edges

Defined in Data.Apart.Structures.Graph

Methods

fold :: Monoid m => Edges m -> m

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

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

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

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

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

foldr1 :: (a -> a -> a) -> Edges a -> a

foldl1 :: (a -> a -> a) -> Edges a -> a

toList :: Edges a -> [a]

null :: Edges a -> Bool

length :: Edges a -> Int

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

maximum :: Ord a => Edges a -> a

minimum :: Ord a => Edges a -> a

sum :: Num a => Edges a -> a

product :: Num a => Edges a -> a

Traversable Edges

Defined in Data.Apart.Structures.Graph

Methods

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

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

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

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

Show a => Show (Edges a)

Defined in Data.Apart.Structures.Graph

Methods

showsPrec :: Int -> Edges a -> ShowS

show :: Edges a -> String

showList :: [Edges a] -> ShowS

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

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

remove :: Eq a => a -> Graph a -> Segmented Graph a

Remove vertex and all of its edges.