{"id":3285,"date":"2017-05-10T06:00:25","date_gmt":"2017-05-10T04:00:25","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=3285"},"modified":"2022-03-26T14:28:04","modified_gmt":"2022-03-26T12:28:04","slug":"grafo-complemenario","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/grafo-complemenario\/","title":{"rendered":"Grafo complemenario"},"content":{"rendered":"

El complementario del grafo G es un grafo G’ del mismo tipo que G (dirigido o no dirigido), con el mismo conjunto de nodos y tal que dos nodos de G’ son adyacentes si y s\u00f3lo si no son adyacentes en G. Los pesos de todas las aristas del complementario es igual a 0.<\/p>\n

Definir la funci\u00f3n<\/p>\n

\n   complementario :: Grafo Int Int -> Grafo Int Int\n<\/pre>\n
tal que (complementario g) es el complementario de g. Por ejemplo,<\/p>\n
\n   \u03bb> complementario (creaGrafo D (1,3) [(1,3,0),(3,2,0),(2,2,0),(2,1,0)])\n   G D (array (1,3) [(1,[(1,0),(2,0)]),(2,[(3,0)]),(3,[(1,0),(3,0)])])\n   \u03bb> complementario (creaGrafo D (1,3) [(3,2,0),(2,2,0),(2,1,0)])\n   G D (array (1,3) [(1,[(1,0),(2,0),(3,0)]),(2,[(3,0)]),(3,[(1,0),(3,0)])])\n<\/pre>\n
Nota<\/strong>: Se usa el m\u00f3dulo Grafo de la librer\u00eda de I1M<\/a> o cualquiera de las implementaciones de grafos (GrafoConVectorDeAdyacencia<\/a> o GrafoConMatrizDeAdyacencia<\/a>).<\/p>\n
Soluciones<\/h4>\n
[schedule expon=’2017-05-17′ expat=\u00bb06:00″]<\/p>\n
    \n
  • Las soluciones se pueden escribir en los comentarios hasta el 17 de mayo.\n
  • El c\u00f3digo se debe escribir entre una l\u00ednea con <pre lang=\u00bbhaskell\u00bb> y otra con <\/pre>\n<\/ul>\n
    [\/schedule]<\/p>\n
    [schedule on=’2017-05-17′ at=\u00bb06:00″]<\/p>\n
    \r\nimport I1M.Grafo\r\n\r\ncomplementario :: Grafo Int Int -> Grafo Int Int\r\ncomplementario g = \r\n    creaGrafo d (1,n) [(x,y,0) | x <- xs, y <- xs, not (aristaEn g (x,y))]\r\n    where d  = if dirigido g then D else ND\r\n          xs = nodos g\r\n          n  = length xs\r\n<\/pre>\n
    [\/schedule]<\/p>\n","protected":false},"excerpt":{"rendered":"
    El complementario del grafo G es un grafo G’ del mismo tipo que G (dirigido o no dirigido), con el mismo conjunto de nodos y tal que dos nodos de G’ son adyacentes si y s\u00f3lo si no son adyacentes en G. Los pesos de todas las aristas del complementario es igual a 0. Definir…<\/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\/3285"}],"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=3285"}],"version-history":[{"count":3,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/3285\/revisions"}],"predecessor-version":[{"id":3288,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/3285\/revisions\/3288"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=3285"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=3285"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=3285"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}