{"id":8190,"date":"2023-06-12T06:00:09","date_gmt":"2023-06-12T04:00:09","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=8190"},"modified":"2023-06-01T18:38:14","modified_gmt":"2023-06-01T16:38:14","slug":"12-jun-23","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/12-jun-23\/","title":{"rendered":"TAD de los grafos: Recorridos en un grafo completo"},"content":{"rendered":"<p>Definir la funci\u00f3n<\/p>\n<pre lang=\"text\">\n   recorridos :: [a] -> [[a]]\n<\/pre>\n<p>tal que <code>recorridos xs<\/code> es la lista de todos los posibles  por el grafo cuyo conjunto de v\u00e9rtices es <code>xs<\/code> y cada v\u00e9rtice se encuentra conectado con todos los otros y los recorridos pasan por todos los v\u00e9rtices una vez y terminan en el v\u00e9rtice inicial. Por ejemplo,<\/p>\n<pre lang=\"text\">\n   \u03bb> recorridos [2,5,3]\n   [[2,5,3,2],[5,2,3,5],[3,5,2,3],[5,3,2,5],[3,2,5,3],[2,3,5,2]]\n<\/pre>\n<p><b>Soluciones<\/b><\/p>\n<p>A continuaci\u00f3n se muestran las <a href=\"#haskell\">soluciones en Haskell<\/a> y las <a href=\"#python\">soluciones en Python<\/a>.<\/p>\n<p><a name=\"haskell\"><\/a><br \/>\n<b>Soluciones en Haskell<\/b><\/p>\n<pre lang=\"haskell\">\nmodule Grafo_Recorridos_en_un_grafo_completo where\n\nimport Data.List (permutations)\nimport Test.Hspec (Spec, hspec, it, shouldBe)\n\nrecorridos :: [a] -> [[a]]\nrecorridos xs = [(y:ys) ++ [y] | y:ys <- permutations xs]\n\n-- Verificaci\u00f3n\n-- ============\n\nverifica :: IO ()\nverifica = hspec spec\n\nspec :: Spec\nspec = do\n  it \"e1\" $\n    recorridos [2 :: Int,5,3] `shouldBe`\n    [[2,5,3,2],[5,2,3,5],[3,5,2,3],[5,3,2,5],[3,2,5,3],[2,3,5,2]]\n\n-- La verificaci\u00f3n es\n--    \u03bb> verifica\n--\n--    e1\n--\n--    Finished in 0.0007 seconds\n--    1 example, 0 failures\n<\/pre>\n<p><a name=\"python\"><\/a><br \/>\n<b>Soluciones en Python<\/b><\/p>\n<pre lang=\"python\">\nfrom itertools import permutations\nfrom typing import TypeVar\n\nA = TypeVar('A')\n\ndef recorridos(xs: list[A]) -> list[list[A]]:\n    return [(list(y) + [y[0]]) for y in permutations(xs)]\n\n# Verificaci\u00f3n\n# ============\n\ndef test_recorridos() -> None:\n    assert recorridos([2, 5, 3]) \\\n        == [[2, 5, 3, 2], [2, 3, 5, 2], [5, 2, 3, 5], [5, 3, 2, 5],\n            [3, 2, 5, 3], [3, 5, 2, 3]]\n    print(\"Verificado\")\n\n# La verificaci\u00f3n es\n#    >>> test_recorridos()\n#    Verificado\n<\/pre>\n","protected":false},"excerpt":{"rendered":"<p>Definir la funci\u00f3n recorridos :: [a] -> [[a]] tal que recorridos xs es la lista de todos los posibles por el grafo cuyo conjunto de v\u00e9rtices es xs y cada v\u00e9rtice se encuentra conectado con todos los otros y los recorridos pasan por todos los v\u00e9rtices una vez y terminan en el v\u00e9rtice inicial. Por&#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":[581],"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\/8190"}],"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=8190"}],"version-history":[{"count":1,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/8190\/revisions"}],"predecessor-version":[{"id":8191,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/8190\/revisions\/8191"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=8190"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=8190"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=8190"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}