Data.Graph.Libgraph

Synopsis

• data Graph vertex arc = Graph {
  • root :: vertex
  • vertices :: [vertex]
  • arcs :: [Arc vertex arc]
  }
• data Arc vertex arc = Arc {
  • source :: vertex
  • target :: vertex
  • arc :: arc
  }
• (-->) :: vertex -> vertex -> SimpleArc vertex
• succs :: Eq vertex => Graph vertex arc -> vertex -> [vertex]
• preds :: Eq vertex => Graph vertex arc -> vertex -> [vertex]
• isSucc :: Eq vertex => Graph vertex arc -> vertex -> vertex -> Bool
• isPred :: Eq vertex => Graph vertex arc -> vertex -> vertex -> Bool
• mapGraph :: (a -> b) -> Graph a c -> Graph b c
• mapArcs :: (a -> b) -> Graph c a -> Graph c b
• data Dfs vertex arc
• data EdgeType
  • = TreeEdge
  • | BackEdge
  • | FwdEdge
  • | CrossEdge
• getDfs :: Eq vertex => Graph vertex arc -> Dfs vertex arc
• getEdgetype :: (Eq vertex, Show vertex) => Dfs vertex arc -> Arc vertex arc -> EdgeType
• getPreorder :: Dfs vertex arc -> [vertex]
• getPostorder :: Dfs vertex arc -> [vertex]
• isAncestor :: (Eq vertex, Show vertex) => Dfs vertex arc -> vertex -> vertex -> Maybe Bool
• data Domsets vertex arc
• getDomsets :: Eq vertex => Graph vertex arc -> Domsets vertex arc
• getDominators :: Eq vertex => vertex -> Domsets vertex arc -> [vertex]
• data CycleTree vertex
  • = CycleTree vertex [CycleTree vertex]
  • | Reducible vertex [CycleTree vertex]
  • | Irreducible [CycleTree vertex]
• getCycles :: Ord vertex => CycleNest vertex -> CycleTree vertex
• getRedHeaders :: CycleNest vertex -> [vertex]
• dagify :: (Ord v, Eq a, Show v) => ([v] -> v) -> Graph v a -> Graph v a
• findFaulty :: (Ord v, Eq a, Show v) => (v -> Judgement) -> ([v] -> v) -> Graph v a -> [v]
• findFaulty_dag :: (Ord v, Eq a, Show v) => (v -> Judgement) -> Graph v a -> [v]
• next_step :: Eq v => Graph v a -> (v -> Judgement) -> v
• next_daq :: Ord v => Graph v a -> (v -> Judgement) -> v
• data Judgement
  • = Right
  • | Wrong
  • | Unassessed
  • | Assisted [AssistedMessage]
• data AssistedMessage
  • = InconclusiveProperty String
  • | PassingProperty String
• showWith :: Eq vertex => Graph vertex arc -> (vertex -> (String, String)) -> (Arc vertex arc -> String) -> String
• escape :: String -> String
• display :: (Graph vertex arc -> String) -> Graph vertex arc -> IO ()
• collapse :: (Show v, Ord v, Eq a) => ([v] -> v) -> Graph v a -> Graph v a
• remove :: (Ord v, Show v) => Graph v a -> Graph v a
• treeDepth :: Ord v => Graph v a -> Int
• succCache :: Ord vertex => Graph vertex arc -> vertex -> [vertex]
• predCache :: Ord vertex => Graph vertex arc -> vertex -> [vertex]

Documentation