{"id":8157,"date":"2023-05-26T06:00:51","date_gmt":"2023-05-26T04:00:51","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=8157"},"modified":"2023-06-03T18:15:26","modified_gmt":"2023-06-03T16:15:26","slug":"26-may-26","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/26-may-26\/","title":{"rendered":"TAD de los grafos: N\u00famero de v\u00e9rtices"},"content":{"rendered":"<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   nVertices :: (Ix v, Num p) => Grafo v p ->  Int\n<\/pre>\n<p>tal que <code>nVertices g<\/code> es el n\u00famero de v\u00e9rtices del grafo <code>g<\/code>. Por ejemplo,<\/p>\n<pre lang=\"text\">\n   nVertices (creaGrafo' D (1,5) [(1,2),(3,1)])   ==  5\n   nVertices (creaGrafo' ND (2,4) [(1,2),(3,1)])  ==  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_Numero_de_vertices where\n\nimport TAD.Grafo (Grafo, Orientacion (D, ND), nodos, creaGrafo')\nimport Data.Ix\n\nnVertices :: (Ix v, Num p) => Grafo v p ->  Int\nnVertices = length . nodos\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_, nodos\n\n\ndef nVertices(g: Grafo) -> int:\n    return len(nodos(g))\n<\/pre>\n","protected":false},"excerpt":{"rendered":"<p>Usando el tipo abstracto de datos de los grafos, definir la funci\u00f3n, nVertices :: (Ix v, Num p) => Grafo v p -> Int tal que nVertices g es el n\u00famero de v\u00e9rtices del grafo g. Por ejemplo, nVertices (creaGrafo&#8217; D (1,5) [(1,2),(3,1)]) == 5 nVertices (creaGrafo&#8217; ND (2,4) [(1,2),(3,1)]) == 3 Soluciones A continuaci\u00f3n&#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\/8157"}],"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=8157"}],"version-history":[{"count":3,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/8157\/revisions"}],"predecessor-version":[{"id":8202,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/8157\/revisions\/8202"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=8157"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=8157"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=8157"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}