Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Lab 4 #3

Open
BertLisser opened this issue Oct 9, 2018 · 0 comments
Open

Lab 4 #3

BertLisser opened this issue Oct 9, 2018 · 0 comments

Comments

@BertLisser
Copy link

Ex. 6
This is wrong code. temp is not sorted and with duplicates.

-- Transitive closure of relation, sorted and without duplicates
trClos :: Ord a => Rel a -> Rel a
trClos xs
    | xs /= temp = trClos temp
    | otherwise = xs
    where temp = (xs `union` concat [ concat [ ([a] @@ [b]) | a <- xs, a /= b] | b <- xs])

Solution

trClos :: Ord a => Rel a -> Rel a
trClos xs
    | xs /= temp = trClos temp
    | otherwise = xs
    where temp = (sort.nub) (xs `union` concat [ concat [ ([a] @@ [b]) | a <- xs, a /= b] | b <- xs])
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant