{"id":216,"date":"2020-08-24T23:39:29","date_gmt":"2020-08-24T21:39:29","guid":{"rendered":"http:\/\/maths-code.fr\/cours\/?page_id=216"},"modified":"2024-04-24T11:53:11","modified_gmt":"2024-04-24T09:53:11","slug":"graphes","status":"publish","type":"page","link":"https:\/\/maths-code.fr\/cours\/graphes\/","title":{"rendered":"Graphes"},"content":{"rendered":"<p><!--more--><\/p>\n<p>Les graphes sont utilis\u00e9s dans de nombreux domaines, \u00e0 commencer par les r\u00e9seaux.<br \/>Historiquement, on attribue \u00e0 Euler, math\u00e9maticien suisse la premi\u00e8re utilisation d&rsquo;un graphe pour r\u00e9soudre le probl\u00e8me des ponts de K\u00f6nigsberg:<\/p>\n<blockquote class=\"wp-block-quote\">\n<p>Le probl\u00e8me consiste \u00e0 d\u00e9terminer s&rsquo;il existe ou non une promenade dans les rues de K\u00f6nigsberg permettant, \u00e0 partir d&rsquo;un point de d\u00e9part au choix, de passer une et une seule fois par chaque pont, et de revenir \u00e0 son point de d\u00e9part, \u00e9tant entendu qu&rsquo;on ne peut traverser le Pregel qu&rsquo;en passant sur les ponts.(wikipedia)<\/p>\n<\/blockquote>\n<figure id=\"attachment_3649\" aria-describedby=\"caption-attachment-3649\" style=\"width: 477px\" class=\"wp-caption aligncenter\"><img loading=\"lazy\" decoding=\"async\" class=\"wp-image-3649 size-full\" src=\"https:\/\/maths-code.fr\/cours\/wp-content\/uploads\/2023\/05\/Konigsberg1.png\" alt=\"Voici une mod\u00e9lisation de la situation par un graphe de degr\u00e9 4.\" width=\"477\" height=\"275\" srcset=\"https:\/\/maths-code.fr\/cours\/wp-content\/uploads\/2023\/05\/Konigsberg1.png 477w, https:\/\/maths-code.fr\/cours\/wp-content\/uploads\/2023\/05\/Konigsberg1-300x173.png 300w\" sizes=\"auto, (max-width: 477px) 100vw, 477px\" \/><figcaption id=\"caption-attachment-3649\" class=\"wp-caption-text\">Voici une mod\u00e9lisation de la situation par un graphe de degr\u00e9 4.<\/figcaption><\/figure>\n<p style=\"text-align: center;\">\n<p>Les points sont appele\u0301s des sommets alors que les liaisons sont appele\u0301es des are\u0302tes. Deux sommets relie\u0301s par une are\u0302te sont dits voisins, et le degre\u0301 d\u2019un sommet est son nombre de voisins.<\/p>\n<hr \/>\n<hr \/>\n\n\n<div class=\"wp-block-media-text alignwide is-stacked-on-mobile\" style=\"grid-template-columns:39% auto\"><figure class=\"wp-block-media-text__media\"><img loading=\"lazy\" decoding=\"async\" width=\"442\" height=\"759\" src=\"https:\/\/maths-code.fr\/cours\/wp-content\/uploads\/2020\/08\/logic_boat.png\" alt=\"\" class=\"wp-image-214 size-full\" srcset=\"https:\/\/maths-code.fr\/cours\/wp-content\/uploads\/2020\/08\/logic_boat.png 442w, https:\/\/maths-code.fr\/cours\/wp-content\/uploads\/2020\/08\/logic_boat-175x300.png 175w\" sizes=\"auto, (max-width: 442px) 100vw, 442px\" \/><\/figure><div class=\"wp-block-media-text__content\">\n<h3 class=\"wp-block-heading\">Cours<\/h3>\n\n\n\n<ul class=\"wp-block-list\">\n<li>NoteBook Jupyter: <a rel=\"noreferrer noopener\" href=\"https:\/\/maths-code.fr\/NSI\/terminale\/graphes\/intro-jupyter.zip\" target=\"_blank\">Introduction aux graphes avec NetworkX<\/a>.<\/li>\n\n\n\n<li>Activit\u00e9 d\u00e9branch\u00e9e: <a href=\"https:\/\/maths-code.fr\/NSI\/terminale\/graphes\/activite.pdf\" target=\"_blank\" rel=\"noreferrer noopener\">Introduction d\u00e9branch\u00e9e aux graphes<\/a>: r\u00e9seau social.<\/li>\n\n\n\n<li>Le cours sur les <a href=\"https:\/\/maths-code.fr\/NSI\/terminale\/graphes\/Graphes_cours4.pdf\">graphes- Structure de donn\u00e9e<\/a> (pdf).<\/li>\n\n\n\n<li>Le cours sur le <a href=\"https:\/\/maths-code.fr\/NSI\/terminale\/graphes\/Graphes_cours_Parcours.pdf\">parcours de graphe <\/a>(pdf).<\/li>\n\n\n\n<li><a href=\"https:\/\/www.youtube.com\/watch?v=lw_GbcA36HA\">Vid\u00e9o de la chaine AlexandreTL sur les graphes<\/a>.<\/li>\n<\/ul>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\"\/>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\"\/>\n\n\n\n<p>Le probl\u00e8me du fermier, de la ch\u00e8vre, du loup et de la salade peut se mod\u00e9liser par un graphe. La solution n&rsquo;est pas donn\u00e9e par l&rsquo;illustration ci-contre. (Du site <a href=\"https:\/\/xkcd.com\/\">XKCD<\/a>)<\/p>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_import_markdown_pro_load_document_selector":0,"_import_markdown_pro_submit_text_textarea":"","footnotes":""},"class_list":["post-216","page","type-page","status-publish","hentry"],"acf":[],"_links":{"self":[{"href":"https:\/\/maths-code.fr\/cours\/wp-json\/wp\/v2\/pages\/216","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/maths-code.fr\/cours\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/maths-code.fr\/cours\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/maths-code.fr\/cours\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/maths-code.fr\/cours\/wp-json\/wp\/v2\/comments?post=216"}],"version-history":[{"count":25,"href":"https:\/\/maths-code.fr\/cours\/wp-json\/wp\/v2\/pages\/216\/revisions"}],"predecessor-version":[{"id":5583,"href":"https:\/\/maths-code.fr\/cours\/wp-json\/wp\/v2\/pages\/216\/revisions\/5583"}],"wp:attachment":[{"href":"https:\/\/maths-code.fr\/cours\/wp-json\/wp\/v2\/media?parent=216"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}