{"id":8154,"date":"2023-05-25T06:00:41","date_gmt":"2023-05-25T04:00:41","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=8154"},"modified":"2023-06-03T18:15:46","modified_gmt":"2023-06-03T16:15:46","slug":"26-may-23","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/26-may-23\/","title":{"rendered":"TAD de los grafos: Grafos ciclos"},"content":{"rendered":"<p>El ciclo de orden n, C(n), es un grafo no dirigido cuyo conjunto de v\u00e9rtices es {1,&#8230;,n} y las aristas son<\/p>\n<pre lang=\"text\">\n   (1,2), (2,3), ..., (n-1,n), (n,1)\n<\/pre>\n<p>Usando el <a href=\"https:\/\/bit.ly\/45cQ3Fo\">tipo abstracto de datos de los grafos<\/a>, definir la funci\u00f3n,<\/p>\n<pre lang=\"text\">\n   grafoCiclo :: Int -> Grafo Int Int\n<\/pre>\n<p>tal que (grafoCiclo n) es el grafo ciclo de orden n. Por ejemplo,<\/p>\n<pre lang=\"text\">\n   \u03bb> grafoCiclo 3\n   G ND ([1,2,3],[(1,2),(1,3),(2,3)])\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_Grafos_ciclos where\n\nimport TAD.Grafo (Grafo, Orientacion (ND), creaGrafo')\nimport Test.Hspec (Spec, hspec, it, shouldBe)\n\ngrafoCiclo :: Int -> Grafo Int Int\ngrafoCiclo n =\n  creaGrafo' ND (1,n) ((n,1):[(x,x+1) | x <- [1..n-1]])\n\n-- Verificaci\u00f3n\n-- ============\n\nverifica :: IO ()\nverifica = hspec spec\n\nspec :: Spec\nspec = do\n  it \"e1\" $\n    show (grafoCiclo 3) `shouldBe`\n    \"G ND ([1,2,3],[(1,2),(1,3),(2,3)])\"\n\n-- La verificaci\u00f3n es\n--    \u03bb> verifica\n--\n--    e1\n--\n--    Finished in 0.0006 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 src.TAD.Grafo import Grafo, Orientacion, creaGrafo_\n\n\ndef grafoCiclo(n: int) -> Grafo:\n    return creaGrafo_(Orientacion.ND,\n                      (1, n),\n                      [(n,1)] + [(x, x + 1) for x in range(1, n)])\n\n# Verificaci\u00f3n\n# ============\n\ndef test_grafoCiclo() -> None:\n    assert str(grafoCiclo(3)) == \\\n        \"G ND ([1, 2, 3], [(1, 2), (1, 3), (2, 3)])\"\n    print(\"Verificado\")\n\n# La verificaci\u00f3n es\n#    >>> test_grafoCiclo()\n#    Verificado\n<\/pre>\n","protected":false},"excerpt":{"rendered":"<p>El ciclo de orden n, C(n), es un grafo no dirigido cuyo conjunto de v\u00e9rtices es {1,&#8230;,n} y las aristas son (1,2), (2,3), &#8230;, (n-1,n), (n,1) Usando el tipo abstracto de datos de los grafos, definir la funci\u00f3n, grafoCiclo :: Int -> Grafo Int Int tal que (grafoCiclo n) es el grafo ciclo de orden&#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\/8154"}],"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=8154"}],"version-history":[{"count":4,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/8154\/revisions"}],"predecessor-version":[{"id":8203,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/8154\/revisions\/8203"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=8154"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=8154"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=8154"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}