Máxima ramificación

3 Comentarios

1. Haskell

   data Arbol a = N a [Arbol a] deriving Show ej1, ej2, ej3 :: Arbol Int ej1 = N 1 [N 2 [],N 3 [N 4 []]] ej2 = N 1 [N 2 [], N 3 [N 4 [], N 5 [], N 6 []]] ej3 = N 1 [N 2 [N 4 [], N 5 [], N 6 []], N 3 [N 7 []]] maximaRamificacion :: Arbol a -> Int maximaRamificacion (N _ []) = 0 maximaRamificacion (N _ xs) = length xs `max` maximum (map maximaRamificacion xs)

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

   data Arbol a = N a [Arbol a]                deriving Show   ej1, ej2, ej3 :: Arbol Int ej1 = N 1 [N 2 [],N 3 [N 4 []]] ej2 = N 1 [N 2 [], N 3 [N 4 [], N 5 [], N 6 []]] ej3 = N 1 [N 2 [N 4 [], N 5 [], N 6 []], N 3 [N 7 []]]   maximaRamificacion :: Arbol a -> Int maximaRamificacion (N _ []) = 0 maximaRamificacion (N _ xs) =   length xs `max` maximum (map maximaRamificacion xs)

   Responder

2. Haskell

   import Data.Function (fix) maximaRamificacion :: Arbol a -> Int maximaRamificacion = maximum . fix (\f (N _ xs) -> length xs: concatMap f xs)

   1 2 3 4 5

   import Data.Function (fix)   maximaRamificacion :: Arbol a -> Int maximaRamificacion =   maximum . fix (\f (N _ xs) -> length xs: concatMap f xs)

   Responder

3. Haskell

   data Arbol a = N a [Arbol a] deriving Show maximaRamificacion :: Arbol a -> Int maximaRamificacion (N _ []) = 1 maximaRamificacion (N _ a) = maximum (length [pliegaArbol b | b <- a] : [maximaRamificacion b | b <- a]) pliegaArbol :: Arbol a -> [a] pliegaArbol (N a []) = [a] pliegaArbol (N a b) = a : concat [pliegaArbol c | c <- b]

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

   data Arbol a = N a [Arbol a]                deriving Show   maximaRamificacion :: Arbol a -> Int maximaRamificacion (N _ []) = 1 maximaRamificacion (N _ a)  =   maximum (length [pliegaArbol b | b <- a] :            [maximaRamificacion b | b <- a])   pliegaArbol :: Arbol a -> [a] pliegaArbol (N a []) = [a] pliegaArbol (N a b)  = a : concat [pliegaArbol c | c <- b]

   Responder