Animation der BFS- und DFS-Beispiele:<\/strong> VL7_anim.pdf<\/a>
Notizen:<\/strong> Beweis Satz 3.8 [PDF]<\/a>
Video:<\/strong> [YouTube]<\/a>, [IBR]<\/a><\/p>\n\n\n\n
Weitere Links<\/h3>\n\n\n\n
Wikipedia-Seite: Warteschlangen<\/a> 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":"default","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":"set","ast-page-background-enabled":"default","ast-page-background-meta":{"desktop":{"background-color":"var(--ast-global-color-4)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"ast-content-background-meta":{"desktop":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"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":8,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/posts\/184\/revisions"}],"predecessor-version":[{"id":4028,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/posts\/184\/revisions\/4028"}],"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}]}}
Interaktive Visualisierung von Warteschlange<\/a>
Wikipedia-Seite: Stapelspeicher (Stack)<\/a>
NEU! Visualisierung: Suche in Graphen<\/a>
Interaktive Visualisierung von Stack<\/a>
Interaktive Visualisierung von Breitensuche<\/a>
Wikipedia-Seite: Breitensuche<\/a>
Interaktive Visualisierung von Tiefensuche<\/a>
Wikipedia-Seite: Tiefensuche<\/a>
Der verteilte “Welle”-Algorithmus aus der Vorlesung<\/a>
Eine technische Version des Verfahrens im Netzwerkkontext: Flooding<\/a>
Allgemeiner: Verteilte Algorithmen<\/a><\/p>\n\n\n\n![\"\"\/](\"https:\/\/www.ibr.cs.tu-bs.de\/courses\/ws1920\/aud\/webpages\/skript\/dfs_med.png\")
<\/a><\/figure>\n","protected":false},"excerpt":{"rendered":"
![Der verteilte “Welle”-Algorithmus aus der Vorlesung<\/a>](\"https:\/\/www.ibr.cs.tu-bs.de\/courses\/ws1920\/aud\/webpages\/skript\/welle.png\"){kind=link}