Estratificación de un árbol

4 Comentarios

1. Haskell

   estratos :: Arbol a -> [[a]] estratos (N a xs) = [nivel n (N a xs) | n <- [0..profundidad (N a xs)] ] nivel :: Int -> Arbol a -> [a] nivel 0 (N a _) = [a] nivel n (N a xs) = concatMap (nivel (n-1)) xs profundidad :: Arbol a -> Int profundidad (N a []) = 0 profundidad (N a xs) = 1 + (maximum (map profundidad xs))

   1 2 3 4 5 6 7 8 9 10 11

   estratos :: Arbol a -> [[a]] estratos (N a xs) =   [nivel n (N a xs) | n <- [0..profundidad (N a xs)] ]   nivel :: Int -> Arbol a -> [a] nivel 0 (N a _)  = [a] nivel n (N a xs) = concatMap (nivel (n-1)) xs   profundidad :: Arbol a -> Int profundidad (N a []) = 0 profundidad (N a xs) = 1 + (maximum (map profundidad xs))

   Responder

2. Haskell

   -- Primer método: estratos :: Arbol a -> [[a]] estratos (N a xs) = takeWhile (not.null) [profundidad b (N a xs) | b <- [0..]] where profundidad 0 (N a xs) = [a] profundidad n (N a xs) = [b | b <- concat (map (profundidad (n-1)) xs)] -- Segundo método: estratos2 :: Arbol a -> [[a]] estratos2 (N a xs) = aux xs [a] where aux [] v = [v] aux xs v = v:aux (concat $ map p xs) (map z xs) p (N a xs) = xs z (N a xs) = a

   1 2 3 4 5 6 7 8 9 10 11 12 13 14

   -- Primer método: estratos :: Arbol a -> [[a]] estratos (N a xs) =   takeWhile (not.null) [profundidad b (N a xs) | b <- [0..]]   where profundidad 0 (N a xs) = [a]         profundidad n (N a xs) = [b | b <- concat (map (profundidad (n-1)) xs)]   -- Segundo método: estratos2 :: Arbol a -> [[a]] estratos2 (N a xs) = aux xs [a]   where aux [] v = [v]         aux xs v = v:aux (concat $ map p xs) (map z xs)         p (N a xs) = xs         z (N a xs) = a

   Responder

3. Haskell

   import Data.List data Arbol a = N a [Arbol a] deriving Show estratos :: Arbol a -> [[a]] estratos (N x xs) = [x] : (map concat . transpose . map estratos) xs

   1 2 3 4 5 6 7

   import Data.List   data Arbol a = N a [Arbol a]   deriving Show   estratos :: Arbol a -> [[a]] estratos (N x xs) = [x] : (map concat . transpose . map estratos) xs

   Responder

4. Haskell

   estratos :: Eq a => Arbol a -> [[a]] estratos b@(N a xs) = [a] : [[ x | x <- pliega b, y <- xs, profundo x y == c] | c <- [1..profundidad b - 1]] profundo :: Eq a => a -> Arbol a -> Int profundo a (N b xs) | b == a = 1 | null xs = 99999 | otherwise = 1 + minimum [profundo a x | x <- xs] profundidad :: Arbol a -> Int profundidad (N a []) = 1 profundidad (N a xs) = 1 + maximum [profundidad x | x <- xs] pliega :: Arbol a -> [a] pliega (N a xs) = a : (concat [pliega x | x <- xs])

   1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

   estratos :: Eq a => Arbol a -> [[a]] estratos b@(N a xs)   = [a] : [[ x | x <- pliega b, y <- xs, profundo x y == c]           | c <- [1..profundidad b - 1]]   profundo :: Eq a => a -> Arbol a -> Int profundo a (N b xs) | b == a    = 1                     | null xs   = 99999                     | otherwise = 1 + minimum [profundo a x | x <- xs]   profundidad :: Arbol a -> Int profundidad (N a []) = 1 profundidad (N a xs) = 1 + maximum [profundidad x | x <- xs]   pliega :: Arbol a -> [a] pliega (N a xs) = a : (concat [pliega x | x <- xs])

   Responder