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

finish implementing bfsSearch

Browse source
This commit is contained in:
JasterV 2025-03-21 09:50:22 +01:00
parent f866bc2025
commit 827797d6b6
1 changed files with 6 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

7
src/Graph.hs
View file

@ -3,6 +3,7 @@
{-# OPTIONS_GHC -Wno-unrecognised-pragmas #-} {-# OPTIONS_GHC -Wno-unrecognised-pragmas #-}
{-# HLINT ignore "Use map once" #-} {-# HLINT ignore "Use map once" #-}
module Graph module Graph
( DiGraph, ( DiGraph,
hasNode, hasNode,
@ -84,7 +85,11 @@ bfsSearch initialGraph start end
Success preds -> Just (findSolution preds) Success preds -> Just (findSolution preds)
where where
findSolution :: DiGraph a -> [a] findSolution :: DiGraph a -> [a]
findSolution _graph = undefined findSolution predecessors = L.reverse (aux end)
where
aux node = case children node predecessors of
[] -> [node]
(x : _) -> node : aux x
bfsSearch' :: SearchState a -> SearchResult a bfsSearch' :: SearchState a -> SearchResult a
bfsSearch' ([], _, _) = Unsuccessful bfsSearch' ([], _, _) = Unsuccessful