libgraph 1.5 → 1.6
raw patch · 3 files changed
+19/−3 lines, 3 filesPVP ok
version bump matches the API change (PVP)
API changes (from Hackage documentation)
+ Data.Graph.Libgraph: Assisted :: String -> Judgement
+ Data.Graph.Libgraph: next_step :: Eq v => Graph v a -> (v -> Judgement) -> v -> v
Files
- Data/Graph/Libgraph.hs +1/−0
- Data/Graph/Libgraph/AlgoDebug.hs +16/−1
- libgraph.cabal +2/−2
Data/Graph/Libgraph.hs view
@@ -24,6 +24,7 @@ , dagify , findFaulty , findFaulty_dag+, next_step , Judgement(..) , showWith , escape
Data/Graph/Libgraph/AlgoDebug.hs view
@@ -3,7 +3,7 @@ import Data.Graph.Libgraph.Dagify(collapse,remove) import Prelude hiding (Right) -data Judgement = Right | Wrong | Unassessed deriving (Eq,Show,Ord)+data Judgement = Right | Wrong | Unassessed | Assisted String deriving (Eq,Show,Ord) findFaulty_dag :: (Ord v, Eq a, Show v) => (v -> Judgement) -> Graph v a -> [v] findFaulty_dag judge g = filter isFaulty (vertices g)@@ -13,3 +13,18 @@ findFaulty :: (Ord v, Eq a, Show v) => (v -> Judgement) -> ([v]->v) -> Graph v a -> [v] findFaulty isWrong merge = (findFaulty_dag isWrong) . (collapse merge) . remove+++next_step :: Eq v => Graph v a -> (v -> Judgement) -> v -> v+next_step tree j v = case j v of+ Unassessed -> v+ Right -> case preds tree v of+ [] -> v+ (w:_) -> next_step tree j w+ Wrong -> case filter (\w -> j w == Unassessed) (succs tree v) of+ [] -> v+ (w:_) -> w++++
libgraph.cabal view
@@ -1,6 +1,6 @@ Name: libgraph -Version: 1.5 -Homepage: http://maartenfaddegon.nl +Version: 1.6 +Homepage: http://maartenfaddegon.nl Synopsis: Store and manipulate data in a graph. Description: A graph type, analysis of graphs and manipulation of graphs. License: BSD3