{"id":5054,"date":"2019-05-30T06:00:34","date_gmt":"2019-05-30T04:00:34","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=5054"},"modified":"2022-03-26T14:22:05","modified_gmt":"2022-03-26T12:22:05","slug":"caminos-en-un-grafo-2019","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/caminos-en-un-grafo-2019\/","title":{"rendered":"Caminos en un grafo"},"content":{"rendered":"<p>Definir las funciones<\/p>\n<pre lang=\"text\"> \n   grafo   :: [(Int,Int)] -> Grafo Int Int\n   caminos :: Grafo Int Int -> Int -> Int -> [[Int]]\n<\/pre>\n<p>tales que<\/p>\n<ul>\n<li>(grafo as) es el grafo no dirigido definido cuyas aristas son as. Por ejemplo, <\/li>\n<\/ul>\n<pre lang=\"text\">   \n     ghci> grafo [(2,4),(4,5)]\n     G ND (array (2,5) [(2,[(4,0)]),(3,[]),(4,[(2,0),(5,0)]),(5,[(4,0)])])\n<\/pre>\n<ul>\n<li>(caminos g a b) es la lista los caminos en el grafo g desde a hasta b sin pasar dos veces por el mismo nodo. Por ejemplo,<\/li>\n<\/ul>\n<pre lang=\"text\">   \n     ghci> sort (caminos (grafo [(1,3),(2,5),(3,5),(3,7),(5,7)]) 1 7)\n     [[1,3,5,7],[1,3,7]]\n     ghci> sort (caminos (grafo [(1,3),(2,5),(3,5),(3,7),(5,7)]) 2 7)\n     [[2,5,3,7],[2,5,7]]\n     ghci> sort (caminos (grafo [(1,3),(2,5),(3,5),(3,7),(5,7)]) 1 2)\n     [[1,3,5,2],[1,3,7,5,2]]\n     ghci> caminos (grafo [(1,3),(2,5),(3,5),(3,7),(5,7)]) 1 4\n     []\n     ghci> length (caminos (grafo [(i,j) | i <- [1..10], j <- [i..10]]) 1 10)\n     109601\n<\/pre>\n<h4>Soluciones<\/h4>\n<p>[schedule expon='2019-06-06' expat=\"06:00\"]<\/p>\n<ul>\n<li>Las soluciones se pueden escribir en los comentarios hasta el 06 de junio.\n<li>El c\u00f3digo se debe escribir entre una l\u00ednea con &#60;pre lang=\"haskell\"&#62; y otra con &#60;\/pre&#62;\n<\/ul>\n<h4>Pensamiento<\/h4>\n<blockquote><p>\nTengo dentro de un herbario<br \/>\nuna tarde disecada,<br \/>\nlila, violeta y dorada.<br \/>\nCaprichos de solitario.<\/p>\n<p>Antonio Machado\n<\/p><\/blockquote>\n<p>[\/schedule]<\/p>\n<p>[schedule on='2019-06-06' at=\"06:00\"]<\/p>\n<pre lang=\"haskell\">\r\nimport Data.List (sort)\r\nimport I1M.Grafo\r\nimport I1M.BusquedaEnEspaciosDeEstados\r\n\r\ngrafo :: [(Int,Int)] -> Grafo Int Int\r\ngrafo as = creaGrafo ND (m,n) [(x,y,0) | (x,y) <- as]\r\n  where ns = map fst as ++ map snd as\r\n        m  = minimum ns\r\n        n  = maximum ns\r\n\r\n-- 1\u00aa soluci\u00f3n\r\n-- ===========\r\n\r\ncaminos :: Grafo Int Int -> Int -> Int -> [[Int]]\r\ncaminos g a b = aux [[b]] where \r\n  aux [] = []\r\n  aux ((x:xs):yss)\r\n    | x == a    = (x:xs) : aux yss\r\n    | otherwise = aux ([z:x:xs | z <- adyacentes g x\r\n                               , z `notElem` (x:xs)] \r\n                       ++ yss) \r\n\r\n-- 2\u00aa soluci\u00f3n (mediante espacio de estados)\r\n-- =========================================\r\n\r\ncaminos2 :: Grafo Int Int -> Int -> Int -> [[Int]]\r\ncaminos2 g a b = buscaEE sucesores esFinal inicial\r\n  where inicial          = [b]\r\n        sucesores (x:xs) = [z:x:xs | z <- adyacentes g x\r\n                                   , z `notElem` (x:xs)] \r\n        esFinal (x:xs)   = x == a\r\n\r\n-- Comparaci\u00f3n de eficiencia\r\n-- =========================\r\n\r\n--    ghci> length (caminos (grafo [(i,j) | i <- [1..10], j <- [i..10]]) 1 10)\r\n--    109601\r\n--    (3.57 secs, 500533816 bytes)\r\n--    ghci> length (caminos2 (grafo [(i,j) | i <- [1..10], j <- [i..10]]) 1 10)\r\n--    109601\r\n--    (3.53 secs, 470814096 bytes)\r\n<\/pre>\n<p>[\/schedule]<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Definir las funciones grafo :: [(Int,Int)] -> Grafo Int Int caminos :: Grafo Int Int -> Int -> Int -> [[Int]] tales que (grafo as) es el grafo no dirigido definido cuyas aristas son as. Por ejemplo, ghci> grafo [(2,4),(4,5)] G ND (array (2,5) [(2,[(4,0)]),(3,[]),(4,[(2,0),(5,0)]),(5,[(4,0)])]) (caminos g a b) es la lista los caminos en&#8230;<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_kad_post_transparent":"","_kad_post_title":"","_kad_post_layout":"","_kad_post_sidebar_id":"","_kad_post_content_style":"","_kad_post_vertical_padding":"","_kad_post_feature":"","_kad_post_feature_position":"","_kad_post_header":false,"_kad_post_footer":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"footnotes":"","_jetpack_memberships_contains_paid_content":false},"categories":[2],"tags":[453],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/5054"}],"collection":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/comments?post=5054"}],"version-history":[{"count":1,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/5054\/revisions"}],"predecessor-version":[{"id":5055,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/5054\/revisions\/5055"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=5054"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=5054"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=5054"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}