blob: 55c61ca4c1500eafba2e8d8b736d7c436fb1965e (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
|
{-# LANGUAGE TupleSections #-}
module Util where
import Data.List
import qualified Data.Map.Strict as Map
uniq :: Eq a => [a] -> [a]
uniq (x:y:zs) | x == y = uniq (y:zs)
| otherwise = x : uniq (y:zs)
uniq l = l
sortUniq :: Ord a => [a] -> [a]
sortUniq = uniq . sort
oppositeGraph :: Ord a => Map.Map a [a] -> Map.Map a [a]
oppositeGraph graph =
let nodes = concat [k : vs | (k, vs) <- Map.assocs graph]
in Map.fromListWith (++) (map (,[]) nodes ++ [(to, [from]) | (from, tos) <- Map.assocs graph, to <- tos])
|
