{"id":8165,"date":"2023-05-30T06:00:49","date_gmt":"2023-05-30T04:00:49","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=8165"},"modified":"2023-06-03T18:14:35","modified_gmt":"2023-06-03T16:14:35","slug":"30-may-23","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/30-may-23\/","title":{"rendered":"TAD de los grafos: Contiguos de un v\u00e9rtice"},"content":{"rendered":"

En un un grafo g, los contiguos de un v\u00e9rtice v es el conjuntos de v\u00e9rtices x de g tales que x es adyacente o incidente con v.<\/p>\n

Usando el tipo abstracto de datos de los grafos<\/a>, definir la funci\u00f3n,<\/p>\n

\n   contiguos :: (Ix v,Num p) => Grafo v p -> v -> [v]\n<\/pre>\n
tal que contiguos g v<\/code> es el conjunto de los v\u00e9rtices de g contiguos con el v\u00e9rtice v. Por ejemplo,<\/p>\n
\n   \u03bb> g1 = creaGrafo' D (1,3) [(1,2),(2,2),(3,1),(3,2)]\n   \u03bb> contiguos g1 1\n   [2,3]\n   \u03bb> contiguos g1 2\n   [2,1,3]\n   \u03bb> contiguos g1 3\n   [1,2]\n   \u03bb> g2 = creaGrafo' ND (1,3) [(1,2),(2,2),(3,1),(3,2)]\n   \u03bb> contiguos g2 1\n   [2,3]\n   \u03bb> contiguos g2 2\n   [1,2,3]\n   \u03bb> contiguos g2 3\n   [1,2]\n<\/pre>\n
Soluciones<\/b><\/p>\n
A continuaci\u00f3n se muestran las soluciones en Haskell<\/a> y las soluciones en Python<\/a>.<\/p>\n
<\/a>
\nSoluciones en Haskell<\/b><\/p>\n
\nmodule Grafo_Contiguos_de_un_vertice where\n\nimport TAD.Grafo (Grafo, Orientacion (D, ND), adyacentes, creaGrafo')\nimport Grafo_Incidentes_de_un_vertice (incidentes)\nimport Data.List (nub)\nimport Data.Ix\nimport Test.Hspec\n\ncontiguos :: (Ix v,Num p) => Grafo v p -> v -> [v]\ncontiguos g v = nub (adyacentes g v ++ incidentes g v)\n\n-- Verificaci\u00f3n\n-- ============\n\nverifica :: IO ()\nverifica = hspec spec\n\nspec :: Spec\nspec = do\n  it \"e1\" $\n    contiguos g1 1 `shouldBe` [2,3]\n  it \"e2\" $\n    contiguos g1 2 `shouldBe` [2,1,3]\n  it \"e3\" $\n    contiguos g1 3 `shouldBe` [1,2]\n  it \"e4\" $\n    contiguos g2 1 `shouldBe` [2,3]\n  it \"e5\" $\n    contiguos g2 2 `shouldBe` [1,2,3]\n  it \"e6\" $\n    contiguos g2 3 `shouldBe` [1,2]\n  where\n    g1, g2 :: Grafo Int Int\n    g1 = creaGrafo' D (1,3) [(1,2),(2,2),(3,1),(3,2)]\n    g2 = creaGrafo' ND (1,3) [(1,2),(2,2),(3,1),(3,2)]\n\n-- La verificaci\u00f3n es\n--    \u03bb> verifica\n--\n--    e1\n--    e2\n--    e3\n--    e4\n--    e5\n--    e6\n--\n--    Finished in 0.0005 seconds\n--    6 examples, 0 failures\n<\/pre>\n
<\/a>
\nSoluciones en Python<\/b><\/p>\n
\nfrom src.Grafo_Incidentes_de_un_vertice import incidentes\nfrom src.TAD.Grafo import Grafo, Orientacion, Vertice, adyacentes, creaGrafo_\n\n\ndef contiguos(g: Grafo, v: Vertice) -> list[Vertice]:\n    return list(set(adyacentes(g, v) + incidentes(g, v)))\n\n# Verificaci\u00f3n\n# ============\n\ndef test_contiguos() -> None:\n    g1 = creaGrafo_(Orientacion.D, (1,3), [(1,2),(2,2),(3,1),(3,2)])\n    g2 = creaGrafo_(Orientacion.ND, (1,3), [(1,2),(2,2),(3,1),(3,2)])\n    assert contiguos(g1, 1) == [2, 3]\n    assert contiguos(g1, 2) == [1, 2, 3]\n    assert contiguos(g1, 3) == [1, 2]\n    assert contiguos(g2, 1) == [2, 3]\n    assert contiguos(g2, 2) == [1, 2, 3]\n    assert contiguos(g2, 3) == [1, 2]\n    print(\"Verificado\")\n\n# La verificaci\u00f3n es\n#    >>> test_contiguos()\n#    Verificado\n<\/pre>\n","protected":false},"excerpt":{"rendered":"
En un un grafo g, los contiguos de un v\u00e9rtice v es el conjuntos de v\u00e9rtices x de g tales que x es adyacente o incidente con v. Usando el tipo abstracto de datos de los grafos, definir la funci\u00f3n, contiguos :: (Ix v,Num p) => Grafo v p -> v -> [v] tal que…<\/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\/8165"}],"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=8165"}],"version-history":[{"count":2,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/8165\/revisions"}],"predecessor-version":[{"id":8200,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/8165\/revisions\/8200"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=8165"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=8165"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=8165"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}