{"id":184,"date":"2022-11-23T11:15:00","date_gmt":"2022-11-23T11:15:00","guid":{"rendered":"https:\/\/aud.ibr.cs.tu-bs.de\/?p=184"},"modified":"2022-11-30T15:49:40","modified_gmt":"2022-11-30T14:49:40","slug":"vorlesung-7","status":"publish","type":"post","link":"https:\/\/aud.ibr.cs.tu-bs.de\/vorlesung-7\/","title":{"rendered":"Vorlesung 7"},"content":{"rendered":"\n<p>In dieser Vorlesung stellen wir grundlegende Datenstrukturen wie Warteschlangen und Stapel vor. Zus\u00e4tzlich werden Breiten- und Tiefensuche behandelt sowie Datenstrukturen f\u00fcr die Codierung von Graphen.<\/p>\n\n\n\n<p><strong>Folien: <\/strong><a href=\"https:\/\/www.ibr.cs.tu-bs.de\/courses\/ws2223\/aud\/skript\/VL7.pdf\">VL7.pdf<\/a><br><strong>Animation der BFS- und DFS-Beispiele:<\/strong> <a href=\"https:\/\/www.ibr.cs.tu-bs.de\/courses\/ws2223\/aud\/skript\/VL7_anim.pdf\">VL7_anim.pdf<\/a><br><strong>Notizen:<\/strong> Beweis Satz 3.8 <a href=\"https:\/\/www.ibr.cs.tu-bs.de\/courses\/ws2223\/aud\/webpages\/skript\/VL6b.pdf\">[PDF]<\/a><br><strong>Video:<\/strong> <a rel=\"noreferrer noopener\" href=\"https:\/\/aud.ibr.cs.tu-bs.de\/go\/vl7_yt\/\" target=\"_blank\">[YouTube]<\/a>, <a rel=\"noreferrer noopener\" href=\"https:\/\/aud.ibr.cs.tu-bs.de\/index.php\/go\/vl7_video\/\" target=\"_blank\">[IBR]<\/a><\/p>\n\n\n\n<h3 class=\"wp-block-heading\">Weitere Links<\/h3>\n\n\n\n<p><a href=\"http:\/\/de.wikipedia.org\/wiki\/Warteschlange_(Datenstruktur)\">Wikipedia-Seite: Warteschlangen<\/a><br><a href=\"https:\/\/www.cs.usfca.edu\/~galles\/visualization\/QueueArray.html\">Interaktive Visualisierung von Warteschlange<\/a><br><a href=\"http:\/\/de.wikipedia.org\/wiki\/Stapelspeicher\">Wikipedia-Seite: Stapelspeicher (Stack)<\/a><br><br>NEU! <a href=\"https:\/\/www.chrislaux.com\/de\/graphsearch.html\">Visualisierung: Suche in Graphen<\/a><br><a href=\"https:\/\/www.cs.usfca.edu\/~galles\/visualization\/StackArray.html\">Interaktive Visualisierung von Stack<\/a><br><a href=\"https:\/\/www.cs.usfca.edu\/~galles\/visualization\/BFS.html\">Interaktive Visualisierung von Breitensuche<\/a><br><a href=\"http:\/\/de.wikipedia.org\/wiki\/Breitensuche\">Wikipedia-Seite: Breitensuche<\/a><br><a href=\"https:\/\/www.cs.usfca.edu\/~galles\/visualization\/DFS.html\">Interaktive Visualisierung von Tiefensuche<\/a><br><a href=\"http:\/\/de.wikipedia.org\/wiki\/Tiefensuche\">Wikipedia-Seite: Tiefensuche<\/a><br><a href=\"https:\/\/www.ibr.cs.tu-bs.de\/courses\/ws1920\/aud\/webpages\/skript\/welle.png\">Der verteilte &#8220;Welle&#8221;-Algorithmus aus der Vorlesung<\/a><br><a href=\"http:\/\/de.wikipedia.org\/wiki\/Flooding-Algorithmus\">Eine technische Version des Verfahrens im Netzwerkkontext: Flooding<\/a><br><a href=\"http:\/\/en.wikipedia.org\/wiki\/Distributed_algorithms\">Allgemeiner: Verteilte Algorithmen<\/a><\/p>\n\n\n\n<figure class=\"wp-block-image size-large\"><a href=\"http:\/\/www.xkcd.com\/761\"><img decoding=\"async\" src=\"https:\/\/www.ibr.cs.tu-bs.de\/courses\/ws1920\/aud\/webpages\/skript\/dfs_med.png\" alt=\"\"\/><\/a><\/figure>\n","protected":false},"excerpt":{"rendered":"<p>In dieser Vorlesung stellen wir grundlegende Datenstrukturen wie Warteschlangen und Stapel vor. Zus\u00e4tzlich werden Breiten- und Tiefensuche behandelt sowie Datenstrukturen f\u00fcr die Codierung von Graphen.<\/p>\n","protected":false},"author":1,"featured_media":185,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_uag_custom_page_level_css":"","site-sidebar-layout":"default","site-content-layout":"default","ast-site-content-layout":"","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"default","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"","footnotes":""},"categories":[6,3,12,8],"tags":[],"uagb_featured_image_src":{"full":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/10\/1920px-Breadth-first-tree.svg_.png",1920,1231,false],"thumbnail":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/10\/1920px-Breadth-first-tree.svg_.png",150,96,false],"medium":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/10\/1920px-Breadth-first-tree.svg_.png",300,192,false],"medium_large":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/10\/1920px-Breadth-first-tree.svg_.png",768,492,false],"large":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/10\/1920px-Breadth-first-tree.svg_.png",1024,657,false],"1536x1536":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/10\/1920px-Breadth-first-tree.svg_.png",1536,985,false],"2048x2048":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/10\/1920px-Breadth-first-tree.svg_.png",1920,1231,false]},"uagb_author_info":{"display_name":"Matthias Konitzny","author_link":"https:\/\/aud.ibr.cs.tu-bs.de\/author\/konitzny\/"},"uagb_comment_info":0,"uagb_excerpt":"In dieser Vorlesung stellen wir grundlegende Datenstrukturen wie Warteschlangen und Stapel vor. Zus\u00e4tzlich werden Breiten- und Tiefensuche behandelt sowie Datenstrukturen f\u00fcr die Codierung von Graphen.","_links":{"self":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/posts\/184"}],"collection":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/comments?post=184"}],"version-history":[{"count":6,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/posts\/184\/revisions"}],"predecessor-version":[{"id":3444,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/posts\/184\/revisions\/3444"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/media\/185"}],"wp:attachment":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/media?parent=184"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/categories?post=184"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/tags?post=184"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}