jasterv/word-ladder.hs
1
0
Fork 0
mirror of https://codeberg.org/JasterV/word-ladder.hs.git synced 2026-04-26 18:10:06 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

fix bfsSearch

Browse source
This commit is contained in:
JasterV 2025-03-23 18:12:50 +01:00
parent 34dcf329d5
commit b0dc140299
1 changed files with 7 additions and 7 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

14
src/Graph.hs
View file

@ -68,12 +68,6 @@ deleteEdge (node, child) = M.alter aux node
deleteEdges :: (Eq a) => [(a, a)] -> DiGraph a -> DiGraph a deleteEdges :: (Eq a) => [(a, a)] -> DiGraph a -> DiGraph a
deleteEdges edges graph = foldr deleteEdge graph edges deleteEdges edges graph = foldr deleteEdge graph edges
addMultiplePredecessors :: (Eq a) => [(a, [a])] -> DiGraph a -> DiGraph a
addMultiplePredecessors [] graph = graph
addMultiplePredecessors ((node, childs) : xs) graph =
let edges = L.map (,node) childs
in addMultiplePredecessors xs (addEdges edges graph)
type SearchState a = ([a], DiGraph a, DiGraph a) type SearchState a = ([a], DiGraph a, DiGraph a)
type SearchResult a = Maybe (DiGraph a) type SearchResult a = Maybe (DiGraph a)
@ -90,6 +84,12 @@ bfsSearch initialGraph start end
[] -> [node] [] -> [node]
(x : _) -> node : aux x (x : _) -> node : aux x
addMultiplePredecessors :: [(a, [a])] -> DiGraph a -> DiGraph a
addMultiplePredecessors [] graph = graph
addMultiplePredecessors ((node, childs) : xs) graph =
let edges = L.map (,node) childs
in addMultiplePredecessors xs (addEdges edges graph)
bfsSearch' :: SearchState a -> SearchResult a bfsSearch' :: SearchState a -> SearchResult a
bfsSearch' ([], _, _) = Nothing bfsSearch' ([], _, _) = Nothing
bfsSearch' (frontier, graph, predecessors) = bfsSearch' (frontier, graph, predecessors) =
@ -109,7 +109,7 @@ bfsSearch initialGraph start end
frontier' = L.concatMap snd neighboursMap frontier' = L.concatMap snd neighboursMap
in if end `L.elem` frontier' in if end `L.elem` frontier'
then then
Just predecessors Just predecessors'
else else
bfsSearch' (frontier', graph', predecessors') bfsSearch' (frontier', graph', predecessors')