<!doctype html>
< html lang = "zh" class = "no-js" >
< head >
< meta charset = "utf-8" >
< meta name = "viewport" content = "width=device-width,initial-scale=1" >
< meta name = "description" content = "一本动画图解、能运行、可提问的数据结构与算法入门书" >
< meta name = "author" content = "Krahets" >
< link rel = "canonical" href = "https://www.hello-algo.com/chapter_graph/graph_traversal/" >
< link rel = "prev" href = "../graph_operations/" >
< link rel = "next" href = "../summary/" >
< link rel = "icon" href = "../../assets/images/favicon.png" >
< meta name = "generator" content = "mkdocs-1.4.2, mkdocs-material-9.1.6" >
< title > 10.3. < / title >
< link rel = "stylesheet" href = "../../assets/stylesheets/main.ded33207.min.css" >
< link rel = "stylesheet" href = "../../assets/stylesheets/palette.a0c5b2b5.min.css" >
< link rel = "preconnect" href = "https://fonts.gstatic.com" crossorigin >
< link rel = "stylesheet" href = "https://fonts.googleapis.com/css?family=Noto+Sans+SC:300,300i,400,400i,700,700i%7CFira+Code:400,400i,700,700i&display=fallback" >
< style > : root { --md-text-font : "Noto Sans SC" ; --md-code-font : "Fira Code" } < / style >
< link rel = "stylesheet" href = "../../stylesheets/extra.css" >
< script > _ _md _scope = new URL ( "../.." , location ) , _ _md _hash = e => [ ... e ] . reduce ( ( e , _ ) => ( e << 5 ) - e + _ . charCodeAt ( 0 ) , 0 ) , _ _md _get = ( e , _ = localStorage , t = _ _md _scope ) => JSON . parse ( _ . getItem ( t . pathname + "." + e ) ) , _ _md _set = ( e , _ , t = localStorage , a = _ _md _scope ) => { try { t . setItem ( a . pathname + "." + e , JSON . stringify ( _ ) ) } catch ( e ) { } } < / script >
< / head >
< body dir = "ltr" data-md-color-scheme = "default" data-md-color-primary = "white" data-md-color-accent = "" >
< script > var palette = _ _md _get ( "__palette" ) ; if ( palette && "object" == typeof palette . color ) for ( var key of Object . keys ( palette . color ) ) document . body . setAttribute ( "data-md-color-" + key , palette . color [ key ] ) < / script >
< input class = "md-toggle" data-md-toggle = "drawer" type = "checkbox" id = "__drawer" autocomplete = "off" >
< input class = "md-toggle" data-md-toggle = "search" type = "checkbox" id = "__search" autocomplete = "off" >
< label class = "md-overlay" for = "__drawer" > < / label >
< div data-md-component = "skip" >
< a href = "#103" class = "md-skip" >
跳转至
< / a >
< / div >
< div data-md-component = "announce" >
< / div >
< header class = "md-header md-header--shadow" data-md-component = "header" >
< nav class = "md-header__inner md-grid" aria-label = "页眉" >
< a href = "../.." title = "Hello 算法" class = "md-header__button md-logo" aria-label = "Hello 算法" data-md-component = "logo" >
< img src = "../../assets/images/logo.png" alt = "logo" >
< / a >
< label class = "md-header__button md-icon" for = "__drawer" >
< svg xmlns = "http://www.w3.org/2000/svg" viewBox = "0 0 24 24" > < path d = "M3 6h18v2H3V6m0 5h18v2H3v-2m0 5h18v2H3v-2Z" / > < / svg >
< / label >
< div class = "md-header__title" data-md-component = "header-title" >
< div class = "md-header__ellipsis" >
< div class = "md-header__topic" >
< span class = "md-ellipsis" >
Hello 算法
< / span >
< / div >
< div class = "md-header__topic" data-md-component = "header-topic" >
< span class = "md-ellipsis" >
10.3. 图的遍历
< / span >
< / div >
< / div >
< / div >
< form class = "md-header__option" data-md-component = "palette" >
< input class = "md-option" data-md-color-media = "" data-md-color-scheme = "default" data-md-color-primary = "white" data-md-color-accent = "" aria-label = "Switch to dark mode" type = "radio" name = "__palette" id = "__palette_1" >
< label class = "md-header__button md-icon" title = "Switch to dark mode" for = "__palette_2" hidden >
< svg xmlns = "http://www.w3.org/2000/svg" viewBox = "0 0 24 24" > < path d = "M12 7a5 5 0 0 1 5 5 5 5 0 0 1-5 5 5 5 0 0 1-5-5 5 5 0 0 1 5-5m0 2a3 3 0 0 0-3 3 3 3 0 0 0 3 3 3 3 0 0 0 3-3 3 3 0 0 0-3-3m0-7 2.39 3.42C13.65 5.15 12.84 5 12 5c-.84 0-1.65.15-2.39.42L12 2M3.34 7l4.16-.35A7.2 7.2 0 0 0 5.94 8.5c-.44.74-.69 1.5-.83 2.29L3.34 7m.02 10 1.76-3.77a7.131 7.131 0 0 0 2.38 4.14L3.36 17M20.65 7l-1.77 3.79a7.023 7.023 0 0 0-2.38-4.15l4.15.36m-.01 10-4.14.36c.59-.51 1.12-1.14 1.54-1.86.42-.73.69-1.5.83-2.29L20.64 17M12 22l-2.41-3.44c.74.27 1.55.44 2.41.44.82 0 1.63-.17 2.37-.44L12 22Z" / > < / svg >
< / label >
< input class = "md-option" data-md-color-media = "" data-md-color-scheme = "slate" data-md-color-primary = "" data-md-color-accent = "" aria-label = "Switch to light mode" type = "radio" name = "__palette" id = "__palette_2" >
< label class = "md-header__button md-icon" title = "Switch to light mode" for = "__palette_1" hidden >
< svg xmlns = "http://www.w3.org/2000/svg" viewBox = "0 0 24 24" > < path d = "m17.75 4.09-2.53 1.94.91 3.06-2.63-1.81-2.63 1.81.91-3.06-2.53-1.94L12.44 4l1.06-3 1.06 3 3.19.09m3.5 6.91-1.64 1.25.59 1.98-1.7-1.17-1.7 1.17.59-1.98L15.75 11l2.06-.05L18.5 9l.69 1.95 2.06.05m-2.28 4.95c.83-.08 1.72 1.1 1.19 1.85-.32.45-.66.87-1.08 1.27C15.17 23 8.84 23 4.94 19.07c-3.91-3.9-3.91-10.24 0-14.14.4-.4.82-.76 1.27-1.08.75-.53 1.93.36 1.85 1.19-.27 2.86.69 5.83 2.89 8.02a9.96 9.96 0 0 0 8.02 2.89m-1.64 2.02a12.08 12.08 0 0 1-7.8-3.47c-2.17-2.19-3.33-5-3.49-7.82-2.81 3.14-2.7 7.96.31 10.98 3.02 3.01 7.84 3.12 10.98.31Z" / > < / svg >
< / label >
< / form >
< label class = "md-header__button md-icon" for = "__search" >
< svg xmlns = "http://www.w3.org/2000/svg" viewBox = "0 0 24 24" > < path d = "M9.5 3A6.5 6.5 0 0 1 16 9.5c0 1.61-.59 3.09-1.56 4.23l.27.27h.79l5 5-1.5 1.5-5-5v-.79l-.27-.27A6.516 6.516 0 0 1 9.5 16 6.5 6.5 0 0 1 3 9.5 6.5 6.5 0 0 1 9.5 3m0 2C7 5 5 7 5 9.5S7 14 9.5 14 14 12 14 9.5 12 5 9.5 5Z" / > < / svg >
< / label >
< div class = "md-search" data-md-component = "search" role = "dialog" >
< label class = "md-search__overlay" for = "__search" > < / label >
< div class = "md-search__inner" role = "search" >
< form class = "md-search__form" name = "search" >
< input type = "text" class = "md-search__input" name = "query" aria-label = "搜索" placeholder = "搜索" autocapitalize = "off" autocorrect = "off" autocomplete = "off" spellcheck = "false" data-md-component = "search-query" required >
< label class = "md-search__icon md-icon" for = "__search" >
< svg xmlns = "http://www.w3.org/2000/svg" viewBox = "0 0 24 24" > < path d = "M9.5 3A6.5 6.5 0 0 1 16 9.5c0 1.61-.59 3.09-1.56 4.23l.27.27h.79l5 5-1.5 1.5-5-5v-.79l-.27-.27A6.516 6.516 0 0 1 9.5 16 6.5 6.5 0 0 1 3 9.5 6.5 6.5 0 0 1 9.5 3m0 2C7 5 5 7 5 9.5S7 14 9.5 14 14 12 14 9.5 12 5 9.5 5Z" / > < / svg >
< svg xmlns = "http://www.w3.org/2000/svg" viewBox = "0 0 24 24" > < path d = "M20 11v2H8l5.5 5.5-1.42 1.42L4.16 12l7.92-7.92L13.5 5.5 8 11h12Z" / > < / svg >
< / label >
< nav class = "md-search__options" aria-label = "查找" >
< a href = "javascript:void(0)" class = "md-search__icon md-icon" title = "分享" aria-label = "分享" data-clipboard data-clipboard-text = "" data-md-component = "search-share" tabindex = "-1" >
< svg xmlns = "http://www.w3.org/2000/svg" viewBox = "0 0 24 24" > < path d = "M18 16.08c-.76 0-1.44.3-1.96.77L8.91 12.7c.05-.23.09-.46.09-.7 0-.24-.04-.47-.09-.7l7.05-4.11c.54.5 1.25.81 2.04.81a3 3 0 0 0 3-3 3 3 0 0 0-3-3 3 3 0 0 0-3 3c0 .24.04.47.09.7L8.04 9.81C7.5 9.31 6.79 9 6 9a3 3 0 0 0-3 3 3 3 0 0 0 3 3c.79 0 1.5-.31 2.04-.81l7.12 4.15c-.05.21-.08.43-.08.66 0 1.61 1.31 2.91 2.92 2.91 1.61 0 2.92-1.3 2.92-2.91A2.92 2.92 0 0 0 18 16.08Z" / > < / svg >
< / a >
< button type = "reset" class = "md-search__icon md-icon" title = "清空当前内容" aria-label = "清空当前内容" tabindex = "-1" >
< svg xmlns = "http://www.w3.org/2000/svg" viewBox = "0 0 24 24" > < path d = "M19 6.41 17.59 5 12 10.59 6.41 5 5 6.41 10.59 12 5 17.59 6.41 19 12 13.41 17.59 19 19 17.59 13.41 12 19 6.41Z" / > < / svg >
< / button >
< / nav >
< div class = "md-search__suggest" data-md-component = "search-suggest" > < / div >
< / form >
< div class = "md-search__output" >
< div class = "md-search__scrollwrap" data-md-scrollfix >
< div class = "md-search-result" data-md-component = "search-result" >
< div class = "md-search-result__meta" >
正在初始化搜索引擎
< / div >
< ol class = "md-search-result__list" role = "presentation" > < / ol >
< / div >
< / div >
< / div >
< / div >
< / div >
< div class = "md-header__source" >
< a href = "https://github.com/krahets/hello-algo" title = "前往仓库" class = "md-source" data-md-component = "source" >
< div class = "md-source__icon md-icon" >
< svg xmlns = "http://www.w3.org/2000/svg" viewBox = "0 0 496 512" > <!-- ! Font Awesome Free 6.4.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2023 Fonticons, Inc. --> < path d = "M165.9 397.4c0 2-2.3 3.6-5.2 3.6-3.3.3-5.6-1.3-5.6-3.6 0-2 2.3-3.6 5.2-3.6 3-.3 5.6 1.3 5.6 3.6zm-31.1-4.5c-.7 2 1.3 4.3 4.3 4.9 2.6 1 5.6 0 6.2-2s-1.3-4.3-4.3-5.2c-2.6-.7-5.5.3-6.2 2.3zm44.2-1.7c-2.9.7-4.9 2.6-4.6 4.9.3 2 2.9 3.3 5.9 2.6 2.9-.7 4.9-2.6 4.6-4.6-.3-1.9-3-3.2-5.9-2.9zM244.8 8C106.1 8 0 113.3 0 252c0 110.9 69.8 205.8 169.5 239.2 12.8 2.3 17.3-5.6 17.3-12.1 0-6.2-.3-40.4-.3-61.4 0 0-70 15-84.7-29.8 0 0-11.4-29.1-27.8-36.6 0 0-22.9-15.7 1.6-15.4 0 0 24.9 2 38.6 25.8 21.9 38.6 58.6 27.5 72.9 20.9 2.3-16 8.8-27.1 16-33.7-55.9-6.2-112.3-14.3-112.3-110.5 0-27.5 7.6-41.3 23.6-58.9-2.6-6.5-11.1-33.3 2.6-67.9 20.9-6.5 69 27 69 27 20-5.6 41.5-8.5 62.8-8.5s42.8 2.9 62.8 8.5c0 0 48.1-33.6 69-27 13.7 34.7 5.2 61.4 2.6 67.9 16 17.7 25.8 31.5 25.8 58.9 0 96.5-58.9 104.2-114.8 110.5 9.2 7.9 17 22.9 17 46.4 0 33.7-.3 75.4-.3 83.6 0 6.5 4.6 14.4 17.3 12.1C428.2 457.8 496 362.9 496 252 496 113.3 383.5 8 244.8 8zM97.2 352.9c-1.3 1-1 3.3.7 5.2 1.6 1.6 3.9 2.3 5.2 1 1.3-1 1-3.3-.7-5.2-1.6-1.6-3.9-2.3-5.2-1zm-10.8-8.1c-.7 1.3.3 2.9 2.3 3.9 1.6 1 3.6.7 4.3-.7.7-1.3-.3-2.9-2.3-3.9-2-.6-3.6-.3-4.3.7zm32.4 35.6c-1.6 1.3-1 4.3 1.3 6.2 2.3 2.3 5.2 2.6 6.5 1 1.3-1.3.7-4.3-1.3-6.2-2.2-2.3-5.2-2.6-6.5-1zm-11.4-14.7c-1.6 1-1.6 3.6 0 5.9 1.6 2.3 4.3 3.3 5.6 2.3 1.6-1.3 1.6-3.9 0-6.2-1.4-2.3-4-3.3-5.6-2z" / > < / svg >
< / div >
< div class = "md-source__repository" >
krahets/hello-algo
< / div >
< / a >
< / div >
< / nav >
< / header >
< div class = "md-container" data-md-component = "container" >
< main class = "md-main" data-md-component = "main" >
< div class = "md-main__inner md-grid" >
< div class = "md-sidebar md-sidebar--primary" data-md-component = "sidebar" data-md-type = "navigation" >
< div class = "md-sidebar__scrollwrap" >
< div class = "md-sidebar__inner" >
< nav class = "md-nav md-nav--primary" aria-label = "导航栏" data-md-level = "0" >
< label class = "md-nav__title" for = "__drawer" >
< a href = "../.." title = "Hello 算法" class = "md-nav__button md-logo" aria-label = "Hello 算法" data-md-component = "logo" >
< img src = "../../assets/images/logo.png" alt = "logo" >
< / a >
Hello 算法
< / label >
< div class = "md-nav__source" >
< a href = "https://github.com/krahets/hello-algo" title = "前往仓库" class = "md-source" data-md-component = "source" >
< div class = "md-source__icon md-icon" >
< svg xmlns = "http://www.w3.org/2000/svg" viewBox = "0 0 496 512" > <!-- ! Font Awesome Free 6.4.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2023 Fonticons, Inc. --> < path d = "M165.9 397.4c0 2-2.3 3.6-5.2 3.6-3.3.3-5.6-1.3-5.6-3.6 0-2 2.3-3.6 5.2-3.6 3-.3 5.6 1.3 5.6 3.6zm-31.1-4.5c-.7 2 1.3 4.3 4.3 4.9 2.6 1 5.6 0 6.2-2s-1.3-4.3-4.3-5.2c-2.6-.7-5.5.3-6.2 2.3zm44.2-1.7c-2.9.7-4.9 2.6-4.6 4.9.3 2 2.9 3.3 5.9 2.6 2.9-.7 4.9-2.6 4.6-4.6-.3-1.9-3-3.2-5.9-2.9zM244.8 8C106.1 8 0 113.3 0 252c0 110.9 69.8 205.8 169.5 239.2 12.8 2.3 17.3-5.6 17.3-12.1 0-6.2-.3-40.4-.3-61.4 0 0-70 15-84.7-29.8 0 0-11.4-29.1-27.8-36.6 0 0-22.9-15.7 1.6-15.4 0 0 24.9 2 38.6 25.8 21.9 38.6 58.6 27.5 72.9 20.9 2.3-16 8.8-27.1 16-33.7-55.9-6.2-112.3-14.3-112.3-110.5 0-27.5 7.6-41.3 23.6-58.9-2.6-6.5-11.1-33.3 2.6-67.9 20.9-6.5 69 27 69 27 20-5.6 41.5-8.5 62.8-8.5s42.8 2.9 62.8 8.5c0 0 48.1-33.6 69-27 13.7 34.7 5.2 61.4 2.6 67.9 16 17.7 25.8 31.5 25.8 58.9 0 96.5-58.9 104.2-114.8 110.5 9.2 7.9 17 22.9 17 46.4 0 33.7-.3 75.4-.3 83.6 0 6.5 4.6 14.4 17.3 12.1C428.2 457.8 496 362.9 496 252 496 113.3 383.5 8 244.8 8zM97.2 352.9c-1.3 1-1 3.3.7 5.2 1.6 1.6 3.9 2.3 5.2 1 1.3-1 1-3.3-.7-5.2-1.6-1.6-3.9-2.3-5.2-1zm-10.8-8.1c-.7 1.3.3 2.9 2.3 3.9 1.6 1 3.6.7 4.3-.7.7-1.3-.3-2.9-2.3-3.9-2-.6-3.6-.3-4.3.7zm32.4 35.6c-1.6 1.3-1 4.3 1.3 6.2 2.3 2.3 5.2 2.6 6.5 1 1.3-1.3.7-4.3-1.3-6.2-2.2-2.3-5.2-2.6-6.5-1zm-11.4-14.7c-1.6 1-1.6 3.6 0 5.9 1.6 2.3 4.3 3.3 5.6 2.3 1.6-1.3 1.6-3.9 0-6.2-1.4-2.3-4-3.3-5.6-2z" / > < / svg >
< / div >
< div class = "md-source__repository" >
krahets/hello-algo
< / div >
< / a >
< / div >
< ul class = "md-nav__list" data-md-scrollfix >
< li class = "md-nav__item md-nav__item--section md-nav__item--nested" >
< input class = "md-nav__toggle md-toggle " type = "checkbox" id = "__nav_1" >
< label class = "md-nav__link" for = "__nav_1" id = "__nav_1_label" tabindex = "0" >
0. 写在前面
< span class = "md-nav__icon md-icon" > < / span >
< / label >
< nav class = "md-nav" data-md-level = "1" aria-labelledby = "__nav_1_label" aria-expanded = "false" >
< label class = "md-nav__title" for = "__nav_1" >
< span class = "md-nav__icon md-icon" > < / span >
0. 写在前面
< / label >
< ul class = "md-nav__list" data-md-scrollfix >
< li class = "md-nav__item" >
< a href = "../../chapter_preface/about_the_book/" class = "md-nav__link" >
0.1. 关于本书
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_preface/suggestions/" class = "md-nav__link" >
0.2. 如何使用本书
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_preface/summary/" class = "md-nav__link" >
0.3. 小结
< / a >
< / li >
< / ul >
< / nav >
< / li >
< li class = "md-nav__item md-nav__item--section md-nav__item--nested" >
< input class = "md-nav__toggle md-toggle " type = "checkbox" id = "__nav_2" >
< label class = "md-nav__link" for = "__nav_2" id = "__nav_2_label" tabindex = "0" >
1. 引言
< span class = "md-nav__icon md-icon" > < / span >
< / label >
< nav class = "md-nav" data-md-level = "1" aria-labelledby = "__nav_2_label" aria-expanded = "false" >
< label class = "md-nav__title" for = "__nav_2" >
< span class = "md-nav__icon md-icon" > < / span >
1. 引言
< / label >
< ul class = "md-nav__list" data-md-scrollfix >
< li class = "md-nav__item" >
< a href = "../../chapter_introduction/algorithms_are_everywhere/" class = "md-nav__link" >
1.1. 算法无处不在
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_introduction/what_is_dsa/" class = "md-nav__link" >
1.2. 算法是什么
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_introduction/summary/" class = "md-nav__link" >
1.3. 小结
< / a >
< / li >
< / ul >
< / nav >
< / li >
< li class = "md-nav__item md-nav__item--section md-nav__item--nested" >
< input class = "md-nav__toggle md-toggle " type = "checkbox" id = "__nav_3" >
< label class = "md-nav__link" for = "__nav_3" id = "__nav_3_label" tabindex = "0" >
2. 复杂度分析
< span class = "md-nav__icon md-icon" > < / span >
< / label >
< nav class = "md-nav" data-md-level = "1" aria-labelledby = "__nav_3_label" aria-expanded = "false" >
< label class = "md-nav__title" for = "__nav_3" >
< span class = "md-nav__icon md-icon" > < / span >
2. 复杂度分析
< / label >
< ul class = "md-nav__list" data-md-scrollfix >
< li class = "md-nav__item" >
< a href = "../../chapter_computational_complexity/performance_evaluation/" class = "md-nav__link" >
2.1. 算法效率评估
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_computational_complexity/time_complexity/" class = "md-nav__link" >
2.2. 时间复杂度
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_computational_complexity/space_complexity/" class = "md-nav__link" >
2.3. 空间复杂度
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_computational_complexity/summary/" class = "md-nav__link" >
2.4. 小结
< / a >
< / li >
< / ul >
< / nav >
< / li >
< li class = "md-nav__item md-nav__item--section md-nav__item--nested" >
< input class = "md-nav__toggle md-toggle " type = "checkbox" id = "__nav_4" >
< label class = "md-nav__link" for = "__nav_4" id = "__nav_4_label" tabindex = "0" >
3. 数据结构简介
< span class = "md-nav__icon md-icon" > < / span >
< / label >
< nav class = "md-nav" data-md-level = "1" aria-labelledby = "__nav_4_label" aria-expanded = "false" >
< label class = "md-nav__title" for = "__nav_4" >
< span class = "md-nav__icon md-icon" > < / span >
3. 数据结构简介
< / label >
< ul class = "md-nav__list" data-md-scrollfix >
< li class = "md-nav__item" >
< a href = "../../chapter_data_structure/data_and_memory/" class = "md-nav__link" >
3.1. 数据与内存
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_data_structure/classification_of_data_structure/" class = "md-nav__link" >
3.2. 数据结构分类
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_data_structure/summary/" class = "md-nav__link" >
3.3. 小结
< / a >
< / li >
< / ul >
< / nav >
< / li >
< li class = "md-nav__item md-nav__item--section md-nav__item--nested" >
< input class = "md-nav__toggle md-toggle " type = "checkbox" id = "__nav_5" >
< label class = "md-nav__link" for = "__nav_5" id = "__nav_5_label" tabindex = "0" >
4. 数组与链表
< span class = "md-nav__icon md-icon" > < / span >
< / label >
< nav class = "md-nav" data-md-level = "1" aria-labelledby = "__nav_5_label" aria-expanded = "false" >
< label class = "md-nav__title" for = "__nav_5" >
< span class = "md-nav__icon md-icon" > < / span >
4. 数组与链表
< / label >
< ul class = "md-nav__list" data-md-scrollfix >
< li class = "md-nav__item" >
< a href = "../../chapter_array_and_linkedlist/array/" class = "md-nav__link" >
4.1. 数组
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_array_and_linkedlist/linked_list/" class = "md-nav__link" >
4.2. 链表
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_array_and_linkedlist/list/" class = "md-nav__link" >
4.3. 列表
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_array_and_linkedlist/summary/" class = "md-nav__link" >
4.4. 小结
< / a >
< / li >
< / ul >
< / nav >
< / li >
< li class = "md-nav__item md-nav__item--section md-nav__item--nested" >
< input class = "md-nav__toggle md-toggle " type = "checkbox" id = "__nav_6" >
< label class = "md-nav__link" for = "__nav_6" id = "__nav_6_label" tabindex = "0" >
5. 栈与队列
< span class = "md-nav__icon md-icon" > < / span >
< / label >
< nav class = "md-nav" data-md-level = "1" aria-labelledby = "__nav_6_label" aria-expanded = "false" >
< label class = "md-nav__title" for = "__nav_6" >
< span class = "md-nav__icon md-icon" > < / span >
5. 栈与队列
< / label >
< ul class = "md-nav__list" data-md-scrollfix >
< li class = "md-nav__item" >
< a href = "../../chapter_stack_and_queue/stack/" class = "md-nav__link" >
5.1. 栈
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_stack_and_queue/queue/" class = "md-nav__link" >
5.2. 队列
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_stack_and_queue/deque/" class = "md-nav__link" >
5.3. 双向队列
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_stack_and_queue/summary/" class = "md-nav__link" >
5.4. 小结
< / a >
< / li >
< / ul >
< / nav >
< / li >
< li class = "md-nav__item md-nav__item--section md-nav__item--nested" >
< input class = "md-nav__toggle md-toggle " type = "checkbox" id = "__nav_7" >
< label class = "md-nav__link" for = "__nav_7" id = "__nav_7_label" tabindex = "0" >
6. 二分查找
< span class = "md-nav__icon md-icon" > < / span >
< / label >
< nav class = "md-nav" data-md-level = "1" aria-labelledby = "__nav_7_label" aria-expanded = "false" >
< label class = "md-nav__title" for = "__nav_7" >
< span class = "md-nav__icon md-icon" > < / span >
6. 二分查找
< / label >
< ul class = "md-nav__list" data-md-scrollfix >
< li class = "md-nav__item" >
< a href = "../../chapter_binary_search/binary_search/" class = "md-nav__link" >
6.1. 二分查找
< / a >
< / li >
< / ul >
< / nav >
< / li >
< li class = "md-nav__item md-nav__item--section md-nav__item--nested" >
< input class = "md-nav__toggle md-toggle " type = "checkbox" id = "__nav_8" >
< label class = "md-nav__link" for = "__nav_8" id = "__nav_8_label" tabindex = "0" >
7. 散列表
< span class = "md-nav__icon md-icon" > < / span >
< / label >
< nav class = "md-nav" data-md-level = "1" aria-labelledby = "__nav_8_label" aria-expanded = "false" >
< label class = "md-nav__title" for = "__nav_8" >
< span class = "md-nav__icon md-icon" > < / span >
7. 散列表
< / label >
< ul class = "md-nav__list" data-md-scrollfix >
< li class = "md-nav__item" >
< a href = "../../chapter_hashing/hash_map/" class = "md-nav__link" >
7.1. 哈希表
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_hashing/hash_collision/" class = "md-nav__link" >
7.2. 哈希冲突处理
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_hashing/summary/" class = "md-nav__link" >
7.3. 小结
< / a >
< / li >
< / ul >
< / nav >
< / li >
< li class = "md-nav__item md-nav__item--section md-nav__item--nested" >
< input class = "md-nav__toggle md-toggle " type = "checkbox" id = "__nav_9" >
< label class = "md-nav__link" for = "__nav_9" id = "__nav_9_label" tabindex = "0" >
8. 树
< span class = "md-nav__icon md-icon" > < / span >
< / label >
< nav class = "md-nav" data-md-level = "1" aria-labelledby = "__nav_9_label" aria-expanded = "false" >
< label class = "md-nav__title" for = "__nav_9" >
< span class = "md-nav__icon md-icon" > < / span >
8. 树
< / label >
< ul class = "md-nav__list" data-md-scrollfix >
< li class = "md-nav__item" >
< a href = "../../chapter_tree/binary_tree/" class = "md-nav__link" >
8.1. 二叉树
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_tree/binary_tree_traversal/" class = "md-nav__link" >
8.2. 二叉树遍历
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_tree/array_representation_of_tree/" class = "md-nav__link" >
8.3. 二叉树数组表示
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_tree/binary_search_tree/" class = "md-nav__link" >
8.4. 二叉搜索树
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_tree/avl_tree/" class = "md-nav__link" >
8.5. AVL 树 *
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_tree/summary/" class = "md-nav__link" >
8.6. 小结
< / a >
< / li >
< / ul >
< / nav >
< / li >
< li class = "md-nav__item md-nav__item--section md-nav__item--nested" >
< input class = "md-nav__toggle md-toggle " type = "checkbox" id = "__nav_10" >
< label class = "md-nav__link" for = "__nav_10" id = "__nav_10_label" tabindex = "0" >
9. 堆
< span class = "md-nav__icon md-icon" > < / span >
< / label >
< nav class = "md-nav" data-md-level = "1" aria-labelledby = "__nav_10_label" aria-expanded = "false" >
< label class = "md-nav__title" for = "__nav_10" >
< span class = "md-nav__icon md-icon" > < / span >
9. 堆
< / label >
< ul class = "md-nav__list" data-md-scrollfix >
< li class = "md-nav__item" >
< a href = "../../chapter_heap/heap/" class = "md-nav__link" >
9.1. 堆
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_heap/build_heap/" class = "md-nav__link" >
9.2. 建堆操作 *
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_heap/summary/" class = "md-nav__link" >
9.3. 小结
< / a >
< / li >
< / ul >
< / nav >
< / li >
< li class = "md-nav__item md-nav__item--active md-nav__item--section md-nav__item--nested" >
< input class = "md-nav__toggle md-toggle " type = "checkbox" id = "__nav_11" checked >
< label class = "md-nav__link" for = "__nav_11" id = "__nav_11_label" tabindex = "0" >
10. 图
< span class = "md-nav__icon md-icon" > < / span >
< / label >
< nav class = "md-nav" data-md-level = "1" aria-labelledby = "__nav_11_label" aria-expanded = "true" >
< label class = "md-nav__title" for = "__nav_11" >
< span class = "md-nav__icon md-icon" > < / span >
10. 图
< / label >
< ul class = "md-nav__list" data-md-scrollfix >
< li class = "md-nav__item" >
< a href = "../graph/" class = "md-nav__link" >
10.1. 图
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../graph_operations/" class = "md-nav__link" >
10.2. 图基础操作
< / a >
< / li >
< li class = "md-nav__item md-nav__item--active" >
< input class = "md-nav__toggle md-toggle" type = "checkbox" id = "__toc" >
< label class = "md-nav__link md-nav__link--active" for = "__toc" >
10.3. 图的遍历
< span class = "md-nav__icon md-icon" > < / span >
< / label >
< a href = "./" class = "md-nav__link md-nav__link--active" >
10.3. 图的遍历
< / a >
< nav class = "md-nav md-nav--secondary" aria-label = "目录" >
< label class = "md-nav__title" for = "__toc" >
< span class = "md-nav__icon md-icon" > < / span >
目录
< / label >
< ul class = "md-nav__list" data-md-component = "toc" data-md-scrollfix >
< li class = "md-nav__item" >
< a href = "#1031" class = "md-nav__link" >
10.3.1. 广度优先遍历
< / a >
< nav class = "md-nav" aria-label = "10.3.1. 广度优先遍历" >
< ul class = "md-nav__list" >
< li class = "md-nav__item" >
< a href = "#_1" class = "md-nav__link" >
算法实现
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "#_2" class = "md-nav__link" >
复杂度分析
< / a >
< / li >
< / ul >
< / nav >
< / li >
< li class = "md-nav__item" >
< a href = "#1032" class = "md-nav__link" >
10.3.2. 深度优先遍历
< / a >
< nav class = "md-nav" aria-label = "10.3.2. 深度优先遍历" >
< ul class = "md-nav__list" >
< li class = "md-nav__item" >
< a href = "#_3" class = "md-nav__link" >
算法实现
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "#_4" class = "md-nav__link" >
复杂度分析
< / a >
< / li >
< / ul >
< / nav >
< / li >
< / ul >
< / nav >
< / li >
< li class = "md-nav__item" >
< a href = "../summary/" class = "md-nav__link" >
10.4. 小结
< / a >
< / li >
< / ul >
< / nav >
< / li >
< li class = "md-nav__item md-nav__item--section md-nav__item--nested" >
< input class = "md-nav__toggle md-toggle " type = "checkbox" id = "__nav_12" >
< label class = "md-nav__link" for = "__nav_12" id = "__nav_12_label" tabindex = "0" >
11. 排序算法
< span class = "md-nav__icon md-icon" > < / span >
< / label >
< nav class = "md-nav" data-md-level = "1" aria-labelledby = "__nav_12_label" aria-expanded = "false" >
< label class = "md-nav__title" for = "__nav_12" >
< span class = "md-nav__icon md-icon" > < / span >
11. 排序算法
< / label >
< ul class = "md-nav__list" data-md-scrollfix >
< li class = "md-nav__item" >
< a href = "../../chapter_sorting/sorting_algorithm/" class = "md-nav__link" >
11.1. 排序算法
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_sorting/bubble_sort/" class = "md-nav__link" >
11.2. 冒泡排序
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_sorting/insertion_sort/" class = "md-nav__link" >
11.3. 插入排序
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_sorting/quick_sort/" class = "md-nav__link" >
11.4. 快速排序
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_sorting/merge_sort/" class = "md-nav__link" >
11.5. 归并排序
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_sorting/bucket_sort/" class = "md-nav__link" >
11.6. 桶排序
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_sorting/counting_sort/" class = "md-nav__link" >
11.7. 计数排序
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_sorting/radix_sort/" class = "md-nav__link" >
11.8. 基数排序
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_sorting/summary/" class = "md-nav__link" >
11.9. 小结
< / a >
< / li >
< / ul >
< / nav >
< / li >
< li class = "md-nav__item md-nav__item--section md-nav__item--nested" >
< input class = "md-nav__toggle md-toggle " type = "checkbox" id = "__nav_13" >
< label class = "md-nav__link" for = "__nav_13" id = "__nav_13_label" tabindex = "0" >
12. 搜索算法
< span class = "md-nav__icon md-icon" > < / span >
< / label >
< nav class = "md-nav" data-md-level = "1" aria-labelledby = "__nav_13_label" aria-expanded = "false" >
< label class = "md-nav__title" for = "__nav_13" >
< span class = "md-nav__icon md-icon" > < / span >
12. 搜索算法
< / label >
< ul class = "md-nav__list" data-md-scrollfix >
< li class = "md-nav__item" >
< a href = "../../chapter_searching/searching_algorithm_revisited/" class = "md-nav__link" >
12.1. 搜索算法（ ）
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_searching/replace_linear_by_hashing/" class = "md-nav__link" >
12.2. 哈希优化策略
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_searching/summary/" class = "md-nav__link" >
12.3. 小结
< / a >
< / li >
< / ul >
< / nav >
< / li >
< li class = "md-nav__item md-nav__item--section md-nav__item--nested" >
< input class = "md-nav__toggle md-toggle " type = "checkbox" id = "__nav_14" >
< label class = "md-nav__link" for = "__nav_14" id = "__nav_14_label" tabindex = "0" >
13. 回溯算法
< span class = "md-nav__icon md-icon" > < / span >
< / label >
< nav class = "md-nav" data-md-level = "1" aria-labelledby = "__nav_14_label" aria-expanded = "false" >
< label class = "md-nav__title" for = "__nav_14" >
< span class = "md-nav__icon md-icon" > < / span >
13. 回溯算法
< / label >
< ul class = "md-nav__list" data-md-scrollfix >
< li class = "md-nav__item" >
< a href = "../../chapter_backtracking/backtracking_algorithm/" class = "md-nav__link" >
13.1. 回溯算法（ ）
< / a >
< / li >
< / ul >
< / nav >
< / li >
< li class = "md-nav__item md-nav__item--section md-nav__item--nested" >
< input class = "md-nav__toggle md-toggle " type = "checkbox" id = "__nav_15" >
< label class = "md-nav__link" for = "__nav_15" id = "__nav_15_label" tabindex = "0" >
14. 附录
< span class = "md-nav__icon md-icon" > < / span >
< / label >
< nav class = "md-nav" data-md-level = "1" aria-labelledby = "__nav_15_label" aria-expanded = "false" >
< label class = "md-nav__title" for = "__nav_15" >
< span class = "md-nav__icon md-icon" > < / span >
14. 附录
< / label >
< ul class = "md-nav__list" data-md-scrollfix >
< li class = "md-nav__item" >
< a href = "../../chapter_appendix/installation/" class = "md-nav__link" >
14.1. 编程环境安装
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "../../chapter_appendix/contribution/" class = "md-nav__link" >
14.2. 一起参与创作
< / a >
< / li >
< / ul >
< / nav >
< / li >
< li class = "md-nav__item md-nav__item--section md-nav__item--nested" >
< input class = "md-nav__toggle md-toggle " type = "checkbox" id = "__nav_16" >
< div class = "md-nav__link md-nav__link--index " >
< a href = "../../chapter_reference/" > 参考文献< / a >
< / div >
< nav class = "md-nav" data-md-level = "1" aria-labelledby = "__nav_16_label" aria-expanded = "false" >
< label class = "md-nav__title" for = "__nav_16" >
< span class = "md-nav__icon md-icon" > < / span >
参考文献
< / label >
< ul class = "md-nav__list" data-md-scrollfix >
< / ul >
< / nav >
< / li >
< / ul >
< / nav >
< / div >
< / div >
< / div >
< div class = "md-sidebar md-sidebar--secondary" data-md-component = "sidebar" data-md-type = "toc" >
< div class = "md-sidebar__scrollwrap" >
< div class = "md-sidebar__inner" >
< nav class = "md-nav md-nav--secondary" aria-label = "目录" >
< label class = "md-nav__title" for = "__toc" >
< span class = "md-nav__icon md-icon" > < / span >
目录
< / label >
< ul class = "md-nav__list" data-md-component = "toc" data-md-scrollfix >
< li class = "md-nav__item" >
< a href = "#1031" class = "md-nav__link" >
10.3.1. 广度优先遍历
< / a >
< nav class = "md-nav" aria-label = "10.3.1. 广度优先遍历" >
< ul class = "md-nav__list" >
< li class = "md-nav__item" >
< a href = "#_1" class = "md-nav__link" >
算法实现
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "#_2" class = "md-nav__link" >
复杂度分析
< / a >
< / li >
< / ul >
< / nav >
< / li >
< li class = "md-nav__item" >
< a href = "#1032" class = "md-nav__link" >
10.3.2. 深度优先遍历
< / a >
< nav class = "md-nav" aria-label = "10.3.2. 深度优先遍历" >
< ul class = "md-nav__list" >
< li class = "md-nav__item" >
< a href = "#_3" class = "md-nav__link" >
算法实现
< / a >
< / li >
< li class = "md-nav__item" >
< a href = "#_4" class = "md-nav__link" >
复杂度分析
< / a >
< / li >
< / ul >
< / nav >
< / li >
< / ul >
< / nav >
< / div >
< / div >
< / div >
< div class = "md-content" data-md-component = "content" >
< article class = "md-content__inner md-typeset" >
< a href = "https://github.com/krahets/hello-algo/tree/main/docs/chapter_graph/graph_traversal.md" title = "编辑此页" class = "md-content__button md-icon" >
< svg xmlns = "http://www.w3.org/2000/svg" viewBox = "0 0 24 24" > < path d = "M10 20H6V4h7v5h5v3.1l2-2V8l-6-6H6c-1.1 0-2 .9-2 2v16c0 1.1.9 2 2 2h4v-2m10.2-7c.1 0 .3.1.4.2l1.3 1.3c.2.2.2.6 0 .8l-1 1-2.1-2.1 1-1c.1-.1.2-.2.4-.2m0 3.9L14.1 23H12v-2.1l6.1-6.1 2.1 2.1Z" / > < / svg >
< / a >
< h1 id = "103" > 10.3. 图的遍历< a class = "headerlink" href = "#103" title = "Permanent link" > ¶ < / a > < / h1 >
< div class = "admonition note" >
< p class = "admonition-title" > 图与树的关系< / p >
< p > 树代表的是“一对多”的关系，而图则具有更高的自由度，可以表示任意的“多对多”关系。因此，我们可以把树看作是图的一种特例。显然，< strong > 树的遍历操作也是图的遍历操作的一种特例< / strong > ，建议你在学习本章节时融会贯通两者的概念与实现方法。< / p >
< / div >
< p > 「图」和「树」都是非线性数据结构，都需要使用「搜索算法」来实现遍历操作。< / p >
< p > 与树类似，图的遍历方式也可分为两种，即「广度优先遍历 Breadth-First Traversal」和「深度优先遍历 Depth-First Traversal」， ， < / p >
< h2 id = "1031" > 10.3.1. 广度优先遍历< a class = "headerlink" href = "#1031" title = "Permanent link" > ¶ < / a > < / h2 >
< p > < strong > 广度优先遍历是一种由近及远的遍历方式，从距离最近的顶点开始访问，并一层层向外扩张< / strong > 。具体来说，从某个顶点出发，先遍历该顶点的所有邻接顶点，然后遍历下一个顶点的所有邻接顶点，以此类推，直至所有顶点访问完毕。< / p >
< p > < img alt = "图的广度优先遍历" src = "../graph_traversal.assets/graph_bfs.png" / > < / p >
< p align = "center" > Fig. 图的广度优先遍历 < / p >
< h3 id = "_1" > 算法实现< a class = "headerlink" href = "#_1" title = "Permanent link" > ¶ < / a > < / h3 >
< p > BFS 通常借助「队列」来实现。队列具有“先入先出”的性质，这与 BFS 的“由近及远”的思想异曲同工。< / p >
< ol >
< li > 将遍历起始顶点 < code > startVet< / code > 加入队列，并开启循环；< / li >
< li > 在循环的每轮迭代中，弹出队首顶点并记录访问，然后将该顶点的所有邻接顶点加入到队列尾部；< / li >
< li > 循环步骤 < code > 2.< / code > ，直到所有顶点被访问完成后结束；< / li >
< / ol >
< p > 为了防止重复遍历顶点，我们需要借助一个哈希表 < code > visited< / code > 来记录哪些节点已被访问。< / p >
< div class = "tabbed-set tabbed-alternate" data-tabs = "1:10" > < input checked = "checked" id = "__tabbed_1_1" name = "__tabbed_1" type = "radio" / > < input id = "__tabbed_1_2" name = "__tabbed_1" type = "radio" / > < input id = "__tabbed_1_3" name = "__tabbed_1" type = "radio" / > < input id = "__tabbed_1_4" name = "__tabbed_1" type = "radio" / > < input id = "__tabbed_1_5" name = "__tabbed_1" type = "radio" / > < input id = "__tabbed_1_6" name = "__tabbed_1" type = "radio" / > < input id = "__tabbed_1_7" name = "__tabbed_1" type = "radio" / > < input id = "__tabbed_1_8" name = "__tabbed_1" type = "radio" / > < input id = "__tabbed_1_9" name = "__tabbed_1" type = "radio" / > < input id = "__tabbed_1_10" name = "__tabbed_1" type = "radio" / > < div class = "tabbed-labels" > < label for = "__tabbed_1_1" > Java< / label > < label for = "__tabbed_1_2" > C++< / label > < label for = "__tabbed_1_3" > Python< / label > < label for = "__tabbed_1_4" > Go< / label > < label for = "__tabbed_1_5" > JavaScript< / label > < label for = "__tabbed_1_6" > TypeScript< / label > < label for = "__tabbed_1_7" > C< / label > < label for = "__tabbed_1_8" > C#< / label > < label for = "__tabbed_1_9" > Swift< / label > < label for = "__tabbed_1_10" > Zig< / label > < / div >
< div class = "tabbed-content" >
< div class = "tabbed-block" >
< div class = "highlight" > < span class = "filename" > graph_bfs.java< / span > < pre > < span > < / span > < code > < a id = "__codelineno-0-1" name = "__codelineno-0-1" href = "#__codelineno-0-1" > < / a > < span class = "cm" > /* 广度优先遍历 BFS */< / span >
< a id = "__codelineno-0-2" name = "__codelineno-0-2" href = "#__codelineno-0-2" > < / a > < span class = "c1" > // 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点< / span >
< a id = "__codelineno-0-3" name = "__codelineno-0-3" href = "#__codelineno-0-3" > < / a > < span class = "n" > List< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "o" > > < / span > < span class = "w" > < / span > < span class = "nf" > graphBFS< / span > < span class = "p" > (< / span > < span class = "n" > GraphAdjList< / span > < span class = "w" > < / span > < span class = "n" > graph< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > Vertex< / span > < span class = "w" > < / span > < span class = "n" > startVet< / span > < span class = "p" > )< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-0-4" name = "__codelineno-0-4" href = "#__codelineno-0-4" > < / a > < span class = "w" > < / span > < span class = "c1" > // 顶点遍历序列< / span >
< a id = "__codelineno-0-5" name = "__codelineno-0-5" href = "#__codelineno-0-5" > < / a > < span class = "w" > < / span > < span class = "n" > List< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "o" > > < / span > < span class = "w" > < / span > < span class = "n" > res< / span > < span class = "w" > < / span > < span class = "o" > =< / span > < span class = "w" > < / span > < span class = "k" > new< / span > < span class = "w" > < / span > < span class = "n" > ArrayList< / span > < span class = "o" > < > < / span > < span class = "p" > ();< / span >
< a id = "__codelineno-0-6" name = "__codelineno-0-6" href = "#__codelineno-0-6" > < / a > < span class = "w" > < / span > < span class = "c1" > // 哈希表，用于记录已被访问过的顶点< / span >
< a id = "__codelineno-0-7" name = "__codelineno-0-7" href = "#__codelineno-0-7" > < / a > < span class = "w" > < / span > < span class = "n" > Set< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "o" > > < / span > < span class = "w" > < / span > < span class = "n" > visited< / span > < span class = "w" > < / span > < span class = "o" > =< / span > < span class = "w" > < / span > < span class = "k" > new< / span > < span class = "w" > < / span > < span class = "n" > HashSet< / span > < span class = "o" > < > < / span > < span class = "p" > ()< / span > < span class = "w" > < / span > < span class = "p" > {{< / span > < span class = "w" > < / span > < span class = "n" > add< / span > < span class = "p" > (< / span > < span class = "n" > startVet< / span > < span class = "p" > );< / span > < span class = "w" > < / span > < span class = "p" > }};< / span >
< a id = "__codelineno-0-8" name = "__codelineno-0-8" href = "#__codelineno-0-8" > < / a > < span class = "w" > < / span > < span class = "c1" > // 队列用于实现 BFS< / span >
< a id = "__codelineno-0-9" name = "__codelineno-0-9" href = "#__codelineno-0-9" > < / a > < span class = "w" > < / span > < span class = "n" > Queue< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "o" > > < / span > < span class = "w" > < / span > < span class = "n" > que< / span > < span class = "w" > < / span > < span class = "o" > =< / span > < span class = "w" > < / span > < span class = "k" > new< / span > < span class = "w" > < / span > < span class = "n" > LinkedList< / span > < span class = "o" > < > < / span > < span class = "p" > ()< / span > < span class = "w" > < / span > < span class = "p" > {{< / span > < span class = "w" > < / span > < span class = "n" > offer< / span > < span class = "p" > (< / span > < span class = "n" > startVet< / span > < span class = "p" > );< / span > < span class = "w" > < / span > < span class = "p" > }};< / span >
< a id = "__codelineno-0-10" name = "__codelineno-0-10" href = "#__codelineno-0-10" > < / a > < span class = "w" > < / span > < span class = "c1" > // 以顶点 vet 为起点，循环直至访问完所有顶点< / span >
< a id = "__codelineno-0-11" name = "__codelineno-0-11" href = "#__codelineno-0-11" > < / a > < span class = "w" > < / span > < span class = "k" > while< / span > < span class = "w" > < / span > < span class = "p" > (< / span > < span class = "o" > !< / span > < span class = "n" > que< / span > < span class = "p" > .< / span > < span class = "na" > isEmpty< / span > < span class = "p" > ())< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-0-12" name = "__codelineno-0-12" href = "#__codelineno-0-12" > < / a > < span class = "w" > < / span > < span class = "n" > Vertex< / span > < span class = "w" > < / span > < span class = "n" > vet< / span > < span class = "w" > < / span > < span class = "o" > =< / span > < span class = "w" > < / span > < span class = "n" > que< / span > < span class = "p" > .< / span > < span class = "na" > poll< / span > < span class = "p" > ();< / span > < span class = "w" > < / span > < span class = "c1" > // 队首顶点出队< / span >
< a id = "__codelineno-0-13" name = "__codelineno-0-13" href = "#__codelineno-0-13" > < / a > < span class = "w" > < / span > < span class = "n" > res< / span > < span class = "p" > .< / span > < span class = "na" > add< / span > < span class = "p" > (< / span > < span class = "n" > vet< / span > < span class = "p" > );< / span > < span class = "w" > < / span > < span class = "c1" > // 记录访问顶点< / span >
< a id = "__codelineno-0-14" name = "__codelineno-0-14" href = "#__codelineno-0-14" > < / a > < span class = "w" > < / span > < span class = "c1" > // 遍历该顶点的所有邻接顶点< / span >
< a id = "__codelineno-0-15" name = "__codelineno-0-15" href = "#__codelineno-0-15" > < / a > < span class = "w" > < / span > < span class = "k" > for< / span > < span class = "w" > < / span > < span class = "p" > (< / span > < span class = "n" > Vertex< / span > < span class = "w" > < / span > < span class = "n" > adjVet< / span > < span class = "w" > < / span > < span class = "p" > :< / span > < span class = "w" > < / span > < span class = "n" > graph< / span > < span class = "p" > .< / span > < span class = "na" > adjList< / span > < span class = "p" > .< / span > < span class = "na" > get< / span > < span class = "p" > (< / span > < span class = "n" > vet< / span > < span class = "p" > ))< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-0-16" name = "__codelineno-0-16" href = "#__codelineno-0-16" > < / a > < span class = "w" > < / span > < span class = "k" > if< / span > < span class = "w" > < / span > < span class = "p" > (< / span > < span class = "n" > visited< / span > < span class = "p" > .< / span > < span class = "na" > contains< / span > < span class = "p" > (< / span > < span class = "n" > adjVet< / span > < span class = "p" > ))< / span >
< a id = "__codelineno-0-17" name = "__codelineno-0-17" href = "#__codelineno-0-17" > < / a > < span class = "w" > < / span > < span class = "k" > continue< / span > < span class = "p" > ;< / span > < span class = "w" > < / span > < span class = "c1" > // 跳过已被访问过的顶点< / span >
< a id = "__codelineno-0-18" name = "__codelineno-0-18" href = "#__codelineno-0-18" > < / a > < span class = "w" > < / span > < span class = "n" > que< / span > < span class = "p" > .< / span > < span class = "na" > offer< / span > < span class = "p" > (< / span > < span class = "n" > adjVet< / span > < span class = "p" > );< / span > < span class = "w" > < / span > < span class = "c1" > // 只入队未访问的顶点< / span >
< a id = "__codelineno-0-19" name = "__codelineno-0-19" href = "#__codelineno-0-19" > < / a > < span class = "w" > < / span > < span class = "n" > visited< / span > < span class = "p" > .< / span > < span class = "na" > add< / span > < span class = "p" > (< / span > < span class = "n" > adjVet< / span > < span class = "p" > );< / span > < span class = "w" > < / span > < span class = "c1" > // 标记该顶点已被访问< / span >
< a id = "__codelineno-0-20" name = "__codelineno-0-20" href = "#__codelineno-0-20" > < / a > < span class = "w" > < / span > < span class = "p" > }< / span >
< a id = "__codelineno-0-21" name = "__codelineno-0-21" href = "#__codelineno-0-21" > < / a > < span class = "w" > < / span > < span class = "p" > }< / span >
< a id = "__codelineno-0-22" name = "__codelineno-0-22" href = "#__codelineno-0-22" > < / a > < span class = "w" > < / span > < span class = "c1" > // 返回顶点遍历序列< / span >
< a id = "__codelineno-0-23" name = "__codelineno-0-23" href = "#__codelineno-0-23" > < / a > < span class = "w" > < / span > < span class = "k" > return< / span > < span class = "w" > < / span > < span class = "n" > res< / span > < span class = "p" > ;< / span >
< a id = "__codelineno-0-24" name = "__codelineno-0-24" href = "#__codelineno-0-24" > < / a > < span class = "p" > }< / span >
< / code > < / pre > < / div >
< / div >
< div class = "tabbed-block" >
< div class = "highlight" > < span class = "filename" > graph_bfs.cpp< / span > < pre > < span > < / span > < code > < a id = "__codelineno-1-1" name = "__codelineno-1-1" href = "#__codelineno-1-1" > < / a > < span class = "cm" > /* 广度优先遍历 BFS */< / span >
< a id = "__codelineno-1-2" name = "__codelineno-1-2" href = "#__codelineno-1-2" > < / a > < span class = "c1" > // 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点< / span >
< a id = "__codelineno-1-3" name = "__codelineno-1-3" href = "#__codelineno-1-3" > < / a > < span class = "n" > vector< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "w" > < / span > < span class = "o" > *> < / span > < span class = "w" > < / span > < span class = "n" > graphBFS< / span > < span class = "p" > (< / span > < span class = "n" > GraphAdjList< / span > < span class = "w" > < / span > < span class = "o" > & < / span > < span class = "n" > graph< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > Vertex< / span > < span class = "w" > < / span > < span class = "o" > *< / span > < span class = "n" > startVet< / span > < span class = "p" > )< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-1-4" name = "__codelineno-1-4" href = "#__codelineno-1-4" > < / a > < span class = "w" > < / span > < span class = "c1" > // 顶点遍历序列< / span >
< a id = "__codelineno-1-5" name = "__codelineno-1-5" href = "#__codelineno-1-5" > < / a > < span class = "w" > < / span > < span class = "n" > vector< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "w" > < / span > < span class = "o" > *> < / span > < span class = "w" > < / span > < span class = "n" > res< / span > < span class = "p" > ;< / span >
< a id = "__codelineno-1-6" name = "__codelineno-1-6" href = "#__codelineno-1-6" > < / a > < span class = "w" > < / span > < span class = "c1" > // 哈希表，用于记录已被访问过的顶点< / span >
< a id = "__codelineno-1-7" name = "__codelineno-1-7" href = "#__codelineno-1-7" > < / a > < span class = "w" > < / span > < span class = "n" > unordered_set< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "w" > < / span > < span class = "o" > *> < / span > < span class = "w" > < / span > < span class = "n" > visited< / span > < span class = "w" > < / span > < span class = "o" > =< / span > < span class = "w" > < / span > < span class = "p" > {< / span > < span class = "n" > startVet< / span > < span class = "p" > };< / span >
< a id = "__codelineno-1-8" name = "__codelineno-1-8" href = "#__codelineno-1-8" > < / a > < span class = "w" > < / span > < span class = "c1" > // 队列用于实现 BFS< / span >
< a id = "__codelineno-1-9" name = "__codelineno-1-9" href = "#__codelineno-1-9" > < / a > < span class = "w" > < / span > < span class = "n" > queue< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "w" > < / span > < span class = "o" > *> < / span > < span class = "w" > < / span > < span class = "n" > que< / span > < span class = "p" > ;< / span >
< a id = "__codelineno-1-10" name = "__codelineno-1-10" href = "#__codelineno-1-10" > < / a > < span class = "w" > < / span > < span class = "n" > que< / span > < span class = "p" > .< / span > < span class = "n" > push< / span > < span class = "p" > (< / span > < span class = "n" > startVet< / span > < span class = "p" > );< / span >
< a id = "__codelineno-1-11" name = "__codelineno-1-11" href = "#__codelineno-1-11" > < / a > < span class = "w" > < / span > < span class = "c1" > // 以顶点 vet 为起点，循环直至访问完所有顶点< / span >
< a id = "__codelineno-1-12" name = "__codelineno-1-12" href = "#__codelineno-1-12" > < / a > < span class = "w" > < / span > < span class = "k" > while< / span > < span class = "w" > < / span > < span class = "p" > (< / span > < span class = "o" > !< / span > < span class = "n" > que< / span > < span class = "p" > .< / span > < span class = "n" > empty< / span > < span class = "p" > ())< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-1-13" name = "__codelineno-1-13" href = "#__codelineno-1-13" > < / a > < span class = "w" > < / span > < span class = "n" > Vertex< / span > < span class = "w" > < / span > < span class = "o" > *< / span > < span class = "n" > vet< / span > < span class = "w" > < / span > < span class = "o" > =< / span > < span class = "w" > < / span > < span class = "n" > que< / span > < span class = "p" > .< / span > < span class = "n" > front< / span > < span class = "p" > ();< / span >
< a id = "__codelineno-1-14" name = "__codelineno-1-14" href = "#__codelineno-1-14" > < / a > < span class = "w" > < / span > < span class = "n" > que< / span > < span class = "p" > .< / span > < span class = "n" > pop< / span > < span class = "p" > ();< / span > < span class = "w" > < / span > < span class = "c1" > // 队首顶点出队< / span >
< a id = "__codelineno-1-15" name = "__codelineno-1-15" href = "#__codelineno-1-15" > < / a > < span class = "w" > < / span > < span class = "n" > res< / span > < span class = "p" > .< / span > < span class = "n" > push_back< / span > < span class = "p" > (< / span > < span class = "n" > vet< / span > < span class = "p" > );< / span > < span class = "w" > < / span > < span class = "c1" > // 记录访问顶点< / span >
< a id = "__codelineno-1-16" name = "__codelineno-1-16" href = "#__codelineno-1-16" > < / a > < span class = "w" > < / span > < span class = "c1" > // 遍历该顶点的所有邻接顶点< / span >
< a id = "__codelineno-1-17" name = "__codelineno-1-17" href = "#__codelineno-1-17" > < / a > < span class = "w" > < / span > < span class = "k" > for< / span > < span class = "w" > < / span > < span class = "p" > (< / span > < span class = "k" > auto< / span > < span class = "w" > < / span > < span class = "n" > adjVet< / span > < span class = "w" > < / span > < span class = "o" > :< / span > < span class = "w" > < / span > < span class = "n" > graph< / span > < span class = "p" > .< / span > < span class = "n" > adjList< / span > < span class = "p" > [< / span > < span class = "n" > vet< / span > < span class = "p" > ])< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-1-18" name = "__codelineno-1-18" href = "#__codelineno-1-18" > < / a > < span class = "w" > < / span > < span class = "k" > if< / span > < span class = "w" > < / span > < span class = "p" > (< / span > < span class = "n" > visited< / span > < span class = "p" > .< / span > < span class = "n" > count< / span > < span class = "p" > (< / span > < span class = "n" > adjVet< / span > < span class = "p" > ))< / span >
< a id = "__codelineno-1-19" name = "__codelineno-1-19" href = "#__codelineno-1-19" > < / a > < span class = "w" > < / span > < span class = "k" > continue< / span > < span class = "p" > ;< / span > < span class = "w" > < / span > < span class = "c1" > // 跳过已被访问过的顶点< / span >
< a id = "__codelineno-1-20" name = "__codelineno-1-20" href = "#__codelineno-1-20" > < / a > < span class = "w" > < / span > < span class = "n" > que< / span > < span class = "p" > .< / span > < span class = "n" > push< / span > < span class = "p" > (< / span > < span class = "n" > adjVet< / span > < span class = "p" > );< / span > < span class = "w" > < / span > < span class = "c1" > // 只入队未访问的顶点< / span >
< a id = "__codelineno-1-21" name = "__codelineno-1-21" href = "#__codelineno-1-21" > < / a > < span class = "w" > < / span > < span class = "n" > visited< / span > < span class = "p" > .< / span > < span class = "n" > emplace< / span > < span class = "p" > (< / span > < span class = "n" > adjVet< / span > < span class = "p" > );< / span > < span class = "w" > < / span > < span class = "c1" > // 标记该顶点已被访问< / span >
< a id = "__codelineno-1-22" name = "__codelineno-1-22" href = "#__codelineno-1-22" > < / a > < span class = "w" > < / span > < span class = "p" > }< / span >
< a id = "__codelineno-1-23" name = "__codelineno-1-23" href = "#__codelineno-1-23" > < / a > < span class = "w" > < / span > < span class = "p" > }< / span >
< a id = "__codelineno-1-24" name = "__codelineno-1-24" href = "#__codelineno-1-24" > < / a > < span class = "w" > < / span > < span class = "c1" > // 返回顶点遍历序列< / span >
< a id = "__codelineno-1-25" name = "__codelineno-1-25" href = "#__codelineno-1-25" > < / a > < span class = "w" > < / span > < span class = "k" > return< / span > < span class = "w" > < / span > < span class = "n" > res< / span > < span class = "p" > ;< / span >
< a id = "__codelineno-1-26" name = "__codelineno-1-26" href = "#__codelineno-1-26" > < / a > < span class = "p" > }< / span >
< / code > < / pre > < / div >
< / div >
< div class = "tabbed-block" >
< div class = "highlight" > < span class = "filename" > graph_bfs.py< / span > < pre > < span > < / span > < code > < a id = "__codelineno-2-1" name = "__codelineno-2-1" href = "#__codelineno-2-1" > < / a > < span class = "k" > def< / span > < span class = "nf" > graph_bfs< / span > < span class = "p" > (< / span > < span class = "n" > graph< / span > < span class = "p" > :< / span > < span class = "n" > GraphAdjList< / span > < span class = "p" > ,< / span > < span class = "n" > start_vet< / span > < span class = "p" > :< / span > < span class = "n" > Vertex< / span > < span class = "p" > )< / span > < span class = "o" > -> < / span > < span class = "nb" > list< / span > < span class = "p" > [< / span > < span class = "n" > Vertex< / span > < span class = "p" > ]:< / span >
< a id = "__codelineno-2-2" name = "__codelineno-2-2" href = "#__codelineno-2-2" > < / a > < span class = "w" > < / span > < span class = "sd" > " " " 广度优先遍历 BFS" " " < / span >
< a id = "__codelineno-2-3" name = "__codelineno-2-3" href = "#__codelineno-2-3" > < / a > < span class = "c1" > # 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点< / span >
< a id = "__codelineno-2-4" name = "__codelineno-2-4" href = "#__codelineno-2-4" > < / a > < span class = "c1" > # 顶点遍历序列< / span >
< a id = "__codelineno-2-5" name = "__codelineno-2-5" href = "#__codelineno-2-5" > < / a > < span class = "n" > res< / span > < span class = "o" > =< / span > < span class = "p" > []< / span >
< a id = "__codelineno-2-6" name = "__codelineno-2-6" href = "#__codelineno-2-6" > < / a > < span class = "c1" > # 哈希表，用于记录已被访问过的顶点< / span >
< a id = "__codelineno-2-7" name = "__codelineno-2-7" href = "#__codelineno-2-7" > < / a > < span class = "n" > visited< / span > < span class = "o" > =< / span > < span class = "nb" > set< / span > < span class = "p" > [< / span > < span class = "n" > Vertex< / span > < span class = "p" > ]([< / span > < span class = "n" > start_vet< / span > < span class = "p" > ])< / span >
< a id = "__codelineno-2-8" name = "__codelineno-2-8" href = "#__codelineno-2-8" > < / a > < span class = "c1" > # 队列用于实现 BFS< / span >
< a id = "__codelineno-2-9" name = "__codelineno-2-9" href = "#__codelineno-2-9" > < / a > < span class = "n" > que< / span > < span class = "o" > =< / span > < span class = "n" > deque< / span > < span class = "p" > [< / span > < span class = "n" > Vertex< / span > < span class = "p" > ]([< / span > < span class = "n" > start_vet< / span > < span class = "p" > ])< / span >
< a id = "__codelineno-2-10" name = "__codelineno-2-10" href = "#__codelineno-2-10" > < / a > < span class = "c1" > # 以顶点 vet 为起点，循环直至访问完所有顶点< / span >
< a id = "__codelineno-2-11" name = "__codelineno-2-11" href = "#__codelineno-2-11" > < / a > < span class = "k" > while< / span > < span class = "nb" > len< / span > < span class = "p" > (< / span > < span class = "n" > que< / span > < span class = "p" > )< / span > < span class = "o" > > < / span > < span class = "mi" > 0< / span > < span class = "p" > :< / span >
< a id = "__codelineno-2-12" name = "__codelineno-2-12" href = "#__codelineno-2-12" > < / a > < span class = "n" > vet< / span > < span class = "o" > =< / span > < span class = "n" > que< / span > < span class = "o" > .< / span > < span class = "n" > popleft< / span > < span class = "p" > ()< / span > < span class = "c1" > # 队首顶点出队< / span >
< a id = "__codelineno-2-13" name = "__codelineno-2-13" href = "#__codelineno-2-13" > < / a > < span class = "n" > res< / span > < span class = "o" > .< / span > < span class = "n" > append< / span > < span class = "p" > (< / span > < span class = "n" > vet< / span > < span class = "p" > )< / span > < span class = "c1" > # 记录访问顶点< / span >
< a id = "__codelineno-2-14" name = "__codelineno-2-14" href = "#__codelineno-2-14" > < / a > < span class = "c1" > # 遍历该顶点的所有邻接顶点< / span >
< a id = "__codelineno-2-15" name = "__codelineno-2-15" href = "#__codelineno-2-15" > < / a > < span class = "k" > for< / span > < span class = "n" > adj_vet< / span > < span class = "ow" > in< / span > < span class = "n" > graph< / span > < span class = "o" > .< / span > < span class = "n" > adj_list< / span > < span class = "p" > [< / span > < span class = "n" > vet< / span > < span class = "p" > ]:< / span >
< a id = "__codelineno-2-16" name = "__codelineno-2-16" href = "#__codelineno-2-16" > < / a > < span class = "k" > if< / span > < span class = "n" > adj_vet< / span > < span class = "ow" > in< / span > < span class = "n" > visited< / span > < span class = "p" > :< / span >
< a id = "__codelineno-2-17" name = "__codelineno-2-17" href = "#__codelineno-2-17" > < / a > < span class = "k" > continue< / span > < span class = "c1" > # 跳过已被访问过的顶点< / span >
< a id = "__codelineno-2-18" name = "__codelineno-2-18" href = "#__codelineno-2-18" > < / a > < span class = "n" > que< / span > < span class = "o" > .< / span > < span class = "n" > append< / span > < span class = "p" > (< / span > < span class = "n" > adj_vet< / span > < span class = "p" > )< / span > < span class = "c1" > # 只入队未访问的顶点< / span >
< a id = "__codelineno-2-19" name = "__codelineno-2-19" href = "#__codelineno-2-19" > < / a > < span class = "n" > visited< / span > < span class = "o" > .< / span > < span class = "n" > add< / span > < span class = "p" > (< / span > < span class = "n" > adj_vet< / span > < span class = "p" > )< / span > < span class = "c1" > # 标记该顶点已被访问< / span >
< a id = "__codelineno-2-20" name = "__codelineno-2-20" href = "#__codelineno-2-20" > < / a > < span class = "c1" > # 返回顶点遍历序列< / span >
< a id = "__codelineno-2-21" name = "__codelineno-2-21" href = "#__codelineno-2-21" > < / a > < span class = "k" > return< / span > < span class = "n" > res< / span >
< / code > < / pre > < / div >
< / div >
< div class = "tabbed-block" >
< div class = "highlight" > < span class = "filename" > graph_bfs.go< / span > < pre > < span > < / span > < code > < a id = "__codelineno-3-1" name = "__codelineno-3-1" href = "#__codelineno-3-1" > < / a > < span class = "cm" > /* 广度优先遍历 BFS */< / span >
< a id = "__codelineno-3-2" name = "__codelineno-3-2" href = "#__codelineno-3-2" > < / a > < span class = "c1" > // 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点< / span >
< a id = "__codelineno-3-3" name = "__codelineno-3-3" href = "#__codelineno-3-3" > < / a > < span class = "kd" > func< / span > < span class = "w" > < / span > < span class = "nx" > graphBFS< / span > < span class = "p" > (< / span > < span class = "nx" > g< / span > < span class = "w" > < / span > < span class = "o" > *< / span > < span class = "nx" > graphAdjList< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > startVet< / span > < span class = "w" > < / span > < span class = "nx" > Vertex< / span > < span class = "p" > )< / span > < span class = "w" > < / span > < span class = "p" > []< / span > < span class = "nx" > Vertex< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-3-4" name = "__codelineno-3-4" href = "#__codelineno-3-4" > < / a > < span class = "w" > < / span > < span class = "c1" > // 顶点遍历序列< / span >
< a id = "__codelineno-3-5" name = "__codelineno-3-5" href = "#__codelineno-3-5" > < / a > < span class = "w" > < / span > < span class = "nx" > res< / span > < span class = "w" > < / span > < span class = "o" > :=< / span > < span class = "w" > < / span > < span class = "nb" > make< / span > < span class = "p" > ([]< / span > < span class = "nx" > Vertex< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "mi" > 0< / span > < span class = "p" > )< / span >
< a id = "__codelineno-3-6" name = "__codelineno-3-6" href = "#__codelineno-3-6" > < / a > < span class = "w" > < / span > < span class = "c1" > // 哈希表，用于记录已被访问过的顶点< / span >
< a id = "__codelineno-3-7" name = "__codelineno-3-7" href = "#__codelineno-3-7" > < / a > < span class = "w" > < / span > < span class = "nx" > visited< / span > < span class = "w" > < / span > < span class = "o" > :=< / span > < span class = "w" > < / span > < span class = "nb" > make< / span > < span class = "p" > (< / span > < span class = "kd" > map< / span > < span class = "p" > [< / span > < span class = "nx" > Vertex< / span > < span class = "p" > ]< / span > < span class = "kd" > struct< / span > < span class = "p" > {})< / span >
< a id = "__codelineno-3-8" name = "__codelineno-3-8" href = "#__codelineno-3-8" > < / a > < span class = "w" > < / span > < span class = "nx" > visited< / span > < span class = "p" > [< / span > < span class = "nx" > startVet< / span > < span class = "p" > ]< / span > < span class = "w" > < / span > < span class = "p" > =< / span > < span class = "w" > < / span > < span class = "kd" > struct< / span > < span class = "p" > {}{}< / span >
< a id = "__codelineno-3-9" name = "__codelineno-3-9" href = "#__codelineno-3-9" > < / a > < span class = "w" > < / span > < span class = "c1" > // 队列用于实现 BFS, 使用切片模拟队列< / span >
< a id = "__codelineno-3-10" name = "__codelineno-3-10" href = "#__codelineno-3-10" > < / a > < span class = "w" > < / span > < span class = "nx" > queue< / span > < span class = "w" > < / span > < span class = "o" > :=< / span > < span class = "w" > < / span > < span class = "nb" > make< / span > < span class = "p" > ([]< / span > < span class = "nx" > Vertex< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "mi" > 0< / span > < span class = "p" > )< / span >
< a id = "__codelineno-3-11" name = "__codelineno-3-11" href = "#__codelineno-3-11" > < / a > < span class = "w" > < / span > < span class = "nx" > queue< / span > < span class = "w" > < / span > < span class = "p" > =< / span > < span class = "w" > < / span > < span class = "nb" > append< / span > < span class = "p" > (< / span > < span class = "nx" > queue< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > startVet< / span > < span class = "p" > )< / span >
< a id = "__codelineno-3-12" name = "__codelineno-3-12" href = "#__codelineno-3-12" > < / a > < span class = "w" > < / span > < span class = "c1" > // 以顶点 vet 为起点，循环直至访问完所有顶点< / span >
< a id = "__codelineno-3-13" name = "__codelineno-3-13" href = "#__codelineno-3-13" > < / a > < span class = "w" > < / span > < span class = "k" > for< / span > < span class = "w" > < / span > < span class = "nb" > len< / span > < span class = "p" > (< / span > < span class = "nx" > queue< / span > < span class = "p" > )< / span > < span class = "w" > < / span > < span class = "p" > > < / span > < span class = "w" > < / span > < span class = "mi" > 0< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-3-14" name = "__codelineno-3-14" href = "#__codelineno-3-14" > < / a > < span class = "w" > < / span > < span class = "c1" > // 队首顶点出队< / span >
< a id = "__codelineno-3-15" name = "__codelineno-3-15" href = "#__codelineno-3-15" > < / a > < span class = "w" > < / span > < span class = "nx" > vet< / span > < span class = "w" > < / span > < span class = "o" > :=< / span > < span class = "w" > < / span > < span class = "nx" > queue< / span > < span class = "p" > [< / span > < span class = "mi" > 0< / span > < span class = "p" > ]< / span >
< a id = "__codelineno-3-16" name = "__codelineno-3-16" href = "#__codelineno-3-16" > < / a > < span class = "w" > < / span > < span class = "nx" > queue< / span > < span class = "w" > < / span > < span class = "p" > =< / span > < span class = "w" > < / span > < span class = "nx" > queue< / span > < span class = "p" > [< / span > < span class = "mi" > 1< / span > < span class = "p" > :]< / span >
< a id = "__codelineno-3-17" name = "__codelineno-3-17" href = "#__codelineno-3-17" > < / a > < span class = "w" > < / span > < span class = "c1" > // 记录访问顶点< / span >
< a id = "__codelineno-3-18" name = "__codelineno-3-18" href = "#__codelineno-3-18" > < / a > < span class = "w" > < / span > < span class = "nx" > res< / span > < span class = "w" > < / span > < span class = "p" > =< / span > < span class = "w" > < / span > < span class = "nb" > append< / span > < span class = "p" > (< / span > < span class = "nx" > res< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > vet< / span > < span class = "p" > )< / span >
< a id = "__codelineno-3-19" name = "__codelineno-3-19" href = "#__codelineno-3-19" > < / a > < span class = "w" > < / span > < span class = "c1" > // 遍历该顶点的所有邻接顶点< / span >
< a id = "__codelineno-3-20" name = "__codelineno-3-20" href = "#__codelineno-3-20" > < / a > < span class = "w" > < / span > < span class = "k" > for< / span > < span class = "w" > < / span > < span class = "nx" > _< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > adjVet< / span > < span class = "w" > < / span > < span class = "o" > :=< / span > < span class = "w" > < / span > < span class = "k" > range< / span > < span class = "w" > < / span > < span class = "nx" > g< / span > < span class = "p" > .< / span > < span class = "nx" > adjList< / span > < span class = "p" > [< / span > < span class = "nx" > vet< / span > < span class = "p" > ]< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-3-21" name = "__codelineno-3-21" href = "#__codelineno-3-21" > < / a > < span class = "w" > < / span > < span class = "nx" > _< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > isExist< / span > < span class = "w" > < / span > < span class = "o" > :=< / span > < span class = "w" > < / span > < span class = "nx" > visited< / span > < span class = "p" > [< / span > < span class = "nx" > adjVet< / span > < span class = "p" > ]< / span >
< a id = "__codelineno-3-22" name = "__codelineno-3-22" href = "#__codelineno-3-22" > < / a > < span class = "w" > < / span > < span class = "c1" > // 只入队未访问的顶点< / span >
< a id = "__codelineno-3-23" name = "__codelineno-3-23" href = "#__codelineno-3-23" > < / a > < span class = "w" > < / span > < span class = "k" > if< / span > < span class = "w" > < / span > < span class = "p" > !< / span > < span class = "nx" > isExist< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-3-24" name = "__codelineno-3-24" href = "#__codelineno-3-24" > < / a > < span class = "w" > < / span > < span class = "nx" > queue< / span > < span class = "w" > < / span > < span class = "p" > =< / span > < span class = "w" > < / span > < span class = "nb" > append< / span > < span class = "p" > (< / span > < span class = "nx" > queue< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > adjVet< / span > < span class = "p" > )< / span >
< a id = "__codelineno-3-25" name = "__codelineno-3-25" href = "#__codelineno-3-25" > < / a > < span class = "w" > < / span > < span class = "nx" > visited< / span > < span class = "p" > [< / span > < span class = "nx" > adjVet< / span > < span class = "p" > ]< / span > < span class = "w" > < / span > < span class = "p" > =< / span > < span class = "w" > < / span > < span class = "kd" > struct< / span > < span class = "p" > {}{}< / span >
< a id = "__codelineno-3-26" name = "__codelineno-3-26" href = "#__codelineno-3-26" > < / a > < span class = "w" > < / span > < span class = "p" > }< / span >
< a id = "__codelineno-3-27" name = "__codelineno-3-27" href = "#__codelineno-3-27" > < / a > < span class = "w" > < / span > < span class = "p" > }< / span >
< a id = "__codelineno-3-28" name = "__codelineno-3-28" href = "#__codelineno-3-28" > < / a > < span class = "w" > < / span > < span class = "p" > }< / span >
< a id = "__codelineno-3-29" name = "__codelineno-3-29" href = "#__codelineno-3-29" > < / a > < span class = "w" > < / span > < span class = "c1" > // 返回顶点遍历序列< / span >
< a id = "__codelineno-3-30" name = "__codelineno-3-30" href = "#__codelineno-3-30" > < / a > < span class = "w" > < / span > < span class = "k" > return< / span > < span class = "w" > < / span > < span class = "nx" > res< / span >
< a id = "__codelineno-3-31" name = "__codelineno-3-31" href = "#__codelineno-3-31" > < / a > < span class = "p" > }< / span >
< / code > < / pre > < / div >
< / div >
< div class = "tabbed-block" >
< div class = "highlight" > < span class = "filename" > graph_bfs.js< / span > < pre > < span > < / span > < code > < a id = "__codelineno-4-1" name = "__codelineno-4-1" href = "#__codelineno-4-1" > < / a > < span class = "cm" > /* 广度优先遍历 BFS */< / span >
< a id = "__codelineno-4-2" name = "__codelineno-4-2" href = "#__codelineno-4-2" > < / a > < span class = "c1" > // 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点< / span >
< a id = "__codelineno-4-3" name = "__codelineno-4-3" href = "#__codelineno-4-3" > < / a > < span class = "kd" > function< / span > < span class = "w" > < / span > < span class = "nx" > graphBFS< / span > < span class = "p" > (< / span > < span class = "nx" > graph< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > startVet< / span > < span class = "p" > )< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-4-4" name = "__codelineno-4-4" href = "#__codelineno-4-4" > < / a > < span class = "w" > < / span > < span class = "c1" > // 顶点遍历序列< / span >
< a id = "__codelineno-4-5" name = "__codelineno-4-5" href = "#__codelineno-4-5" > < / a > < span class = "w" > < / span > < span class = "kd" > const< / span > < span class = "w" > < / span > < span class = "nx" > res< / span > < span class = "w" > < / span > < span class = "o" > =< / span > < span class = "w" > < / span > < span class = "p" > [];< / span >
< a id = "__codelineno-4-6" name = "__codelineno-4-6" href = "#__codelineno-4-6" > < / a > < span class = "w" > < / span > < span class = "c1" > // 哈希表，用于记录已被访问过的顶点< / span >
< a id = "__codelineno-4-7" name = "__codelineno-4-7" href = "#__codelineno-4-7" > < / a > < span class = "w" > < / span > < span class = "kd" > const< / span > < span class = "w" > < / span > < span class = "nx" > visited< / span > < span class = "w" > < / span > < span class = "o" > =< / span > < span class = "w" > < / span > < span class = "ow" > new< / span > < span class = "w" > < / span > < span class = "nb" > Set< / span > < span class = "p" > ();< / span >
< a id = "__codelineno-4-8" name = "__codelineno-4-8" href = "#__codelineno-4-8" > < / a > < span class = "w" > < / span > < span class = "nx" > visited< / span > < span class = "p" > .< / span > < span class = "nx" > add< / span > < span class = "p" > (< / span > < span class = "nx" > startVet< / span > < span class = "p" > );< / span >
< a id = "__codelineno-4-9" name = "__codelineno-4-9" href = "#__codelineno-4-9" > < / a > < span class = "w" > < / span > < span class = "c1" > // 队列用于实现 BFS< / span >
< a id = "__codelineno-4-10" name = "__codelineno-4-10" href = "#__codelineno-4-10" > < / a > < span class = "w" > < / span > < span class = "kd" > const< / span > < span class = "w" > < / span > < span class = "nx" > que< / span > < span class = "w" > < / span > < span class = "o" > =< / span > < span class = "w" > < / span > < span class = "p" > [< / span > < span class = "nx" > startVet< / span > < span class = "p" > ];< / span >
< a id = "__codelineno-4-11" name = "__codelineno-4-11" href = "#__codelineno-4-11" > < / a > < span class = "w" > < / span > < span class = "c1" > // 以顶点 vet 为起点，循环直至访问完所有顶点< / span >
< a id = "__codelineno-4-12" name = "__codelineno-4-12" href = "#__codelineno-4-12" > < / a > < span class = "w" > < / span > < span class = "k" > while< / span > < span class = "w" > < / span > < span class = "p" > (< / span > < span class = "nx" > que< / span > < span class = "p" > .< / span > < span class = "nx" > length< / span > < span class = "p" > )< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-4-13" name = "__codelineno-4-13" href = "#__codelineno-4-13" > < / a > < span class = "w" > < / span > < span class = "kd" > const< / span > < span class = "w" > < / span > < span class = "nx" > vet< / span > < span class = "w" > < / span > < span class = "o" > =< / span > < span class = "w" > < / span > < span class = "nx" > que< / span > < span class = "p" > .< / span > < span class = "nx" > shift< / span > < span class = "p" > ();< / span > < span class = "w" > < / span > < span class = "c1" > // 队首顶点出队< / span >
< a id = "__codelineno-4-14" name = "__codelineno-4-14" href = "#__codelineno-4-14" > < / a > < span class = "w" > < / span > < span class = "nx" > res< / span > < span class = "p" > .< / span > < span class = "nx" > push< / span > < span class = "p" > (< / span > < span class = "nx" > vet< / span > < span class = "p" > );< / span > < span class = "w" > < / span > < span class = "c1" > // 记录访问顶点< / span >
< a id = "__codelineno-4-15" name = "__codelineno-4-15" href = "#__codelineno-4-15" > < / a > < span class = "w" > < / span > < span class = "c1" > // 遍历该顶点的所有邻接顶点< / span >
< a id = "__codelineno-4-16" name = "__codelineno-4-16" href = "#__codelineno-4-16" > < / a > < span class = "w" > < / span > < span class = "k" > for< / span > < span class = "w" > < / span > < span class = "p" > (< / span > < span class = "kd" > const< / span > < span class = "w" > < / span > < span class = "nx" > adjVet< / span > < span class = "w" > < / span > < span class = "k" > of< / span > < span class = "w" > < / span > < span class = "nx" > graph< / span > < span class = "p" > .< / span > < span class = "nx" > adjList< / span > < span class = "p" > .< / span > < span class = "nx" > get< / span > < span class = "p" > (< / span > < span class = "nx" > vet< / span > < span class = "p" > )< / span > < span class = "w" > < / span > < span class = "o" > ??< / span > < span class = "w" > < / span > < span class = "p" > [])< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-4-17" name = "__codelineno-4-17" href = "#__codelineno-4-17" > < / a > < span class = "w" > < / span > < span class = "k" > if< / span > < span class = "w" > < / span > < span class = "p" > (< / span > < span class = "nx" > visited< / span > < span class = "p" > .< / span > < span class = "nx" > has< / span > < span class = "p" > (< / span > < span class = "nx" > adjVet< / span > < span class = "p" > ))< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-4-18" name = "__codelineno-4-18" href = "#__codelineno-4-18" > < / a > < span class = "w" > < / span > < span class = "k" > continue< / span > < span class = "p" > ;< / span > < span class = "w" > < / span > < span class = "c1" > // 跳过已被访问过的顶点< / span >
< a id = "__codelineno-4-19" name = "__codelineno-4-19" href = "#__codelineno-4-19" > < / a > < span class = "w" > < / span > < span class = "p" > }< / span >
< a id = "__codelineno-4-20" name = "__codelineno-4-20" href = "#__codelineno-4-20" > < / a > < span class = "w" > < / span > < span class = "nx" > que< / span > < span class = "p" > .< / span > < span class = "nx" > push< / span > < span class = "p" > (< / span > < span class = "nx" > adjVet< / span > < span class = "p" > );< / span > < span class = "w" > < / span > < span class = "c1" > // 只入队未访问的顶点< / span >
< a id = "__codelineno-4-21" name = "__codelineno-4-21" href = "#__codelineno-4-21" > < / a > < span class = "w" > < / span > < span class = "nx" > visited< / span > < span class = "p" > .< / span > < span class = "nx" > add< / span > < span class = "p" > (< / span > < span class = "nx" > adjVet< / span > < span class = "p" > );< / span > < span class = "w" > < / span > < span class = "c1" > // 标记该顶点已被访问< / span >
< a id = "__codelineno-4-22" name = "__codelineno-4-22" href = "#__codelineno-4-22" > < / a > < span class = "w" > < / span > < span class = "p" > }< / span >
< a id = "__codelineno-4-23" name = "__codelineno-4-23" href = "#__codelineno-4-23" > < / a > < span class = "w" > < / span > < span class = "p" > }< / span >
< a id = "__codelineno-4-24" name = "__codelineno-4-24" href = "#__codelineno-4-24" > < / a > < span class = "w" > < / span > < span class = "c1" > // 返回顶点遍历序列< / span >
< a id = "__codelineno-4-25" name = "__codelineno-4-25" href = "#__codelineno-4-25" > < / a > < span class = "w" > < / span > < span class = "k" > return< / span > < span class = "w" > < / span > < span class = "nx" > res< / span > < span class = "p" > ;< / span >
< a id = "__codelineno-4-26" name = "__codelineno-4-26" href = "#__codelineno-4-26" > < / a > < span class = "p" > }< / span >
< / code > < / pre > < / div >
< / div >
< div class = "tabbed-block" >
< div class = "highlight" > < span class = "filename" > graph_bfs.ts< / span > < pre > < span > < / span > < code > < a id = "__codelineno-5-1" name = "__codelineno-5-1" href = "#__codelineno-5-1" > < / a > < span class = "cm" > /* 广度优先遍历 BFS */< / span >
< a id = "__codelineno-5-2" name = "__codelineno-5-2" href = "#__codelineno-5-2" > < / a > < span class = "c1" > // 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点< / span >
< a id = "__codelineno-5-3" name = "__codelineno-5-3" href = "#__codelineno-5-3" > < / a > < span class = "kd" > function< / span > < span class = "w" > < / span > < span class = "nx" > graphBFS< / span > < span class = "p" > (< / span > < span class = "nx" > graph< / span > < span class = "o" > :< / span > < span class = "w" > < / span > < span class = "kt" > GraphAdjList< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > startVet< / span > < span class = "o" > :< / span > < span class = "w" > < / span > < span class = "kt" > Vertex< / span > < span class = "p" > )< / span > < span class = "o" > :< / span > < span class = "w" > < / span > < span class = "nx" > Vertex< / span > < span class = "p" > []< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-5-4" name = "__codelineno-5-4" href = "#__codelineno-5-4" > < / a > < span class = "w" > < / span > < span class = "c1" > // 顶点遍历序列< / span >
< a id = "__codelineno-5-5" name = "__codelineno-5-5" href = "#__codelineno-5-5" > < / a > < span class = "w" > < / span > < span class = "kd" > const< / span > < span class = "w" > < / span > < span class = "nx" > res< / span > < span class = "o" > :< / span > < span class = "w" > < / span > < span class = "kt" > Vertex< / span > < span class = "p" > []< / span > < span class = "w" > < / span > < span class = "o" > =< / span > < span class = "w" > < / span > < span class = "p" > [];< / span >
< a id = "__codelineno-5-6" name = "__codelineno-5-6" href = "#__codelineno-5-6" > < / a > < span class = "w" > < / span > < span class = "c1" > // 哈希表，用于记录已被访问过的顶点< / span >
< a id = "__codelineno-5-7" name = "__codelineno-5-7" href = "#__codelineno-5-7" > < / a > < span class = "w" > < / span > < span class = "kd" > const< / span > < span class = "w" > < / span > < span class = "nx" > visited< / span > < span class = "o" > :< / span > < span class = "w" > < / span > < span class = "kt" > Set< / span > < span class = "o" > < < / span > < span class = "nx" > Vertex< / span > < span class = "o" > > < / span > < span class = "w" > < / span > < span class = "o" > =< / span > < span class = "w" > < / span > < span class = "ow" > new< / span > < span class = "w" > < / span > < span class = "nb" > Set< / span > < span class = "p" > ();< / span >
< a id = "__codelineno-5-8" name = "__codelineno-5-8" href = "#__codelineno-5-8" > < / a > < span class = "w" > < / span > < span class = "nx" > visited< / span > < span class = "p" > .< / span > < span class = "nx" > add< / span > < span class = "p" > (< / span > < span class = "nx" > startVet< / span > < span class = "p" > );< / span >
< a id = "__codelineno-5-9" name = "__codelineno-5-9" href = "#__codelineno-5-9" > < / a > < span class = "w" > < / span > < span class = "c1" > // 队列用于实现 BFS< / span >
< a id = "__codelineno-5-10" name = "__codelineno-5-10" href = "#__codelineno-5-10" > < / a > < span class = "w" > < / span > < span class = "kd" > const< / span > < span class = "w" > < / span > < span class = "nx" > que< / span > < span class = "w" > < / span > < span class = "o" > =< / span > < span class = "w" > < / span > < span class = "p" > [< / span > < span class = "nx" > startVet< / span > < span class = "p" > ];< / span >
< a id = "__codelineno-5-11" name = "__codelineno-5-11" href = "#__codelineno-5-11" > < / a > < span class = "w" > < / span > < span class = "c1" > // 以顶点 vet 为起点，循环直至访问完所有顶点< / span >
< a id = "__codelineno-5-12" name = "__codelineno-5-12" href = "#__codelineno-5-12" > < / a > < span class = "w" > < / span > < span class = "k" > while< / span > < span class = "w" > < / span > < span class = "p" > (< / span > < span class = "nx" > que< / span > < span class = "p" > .< / span > < span class = "nx" > length< / span > < span class = "p" > )< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-5-13" name = "__codelineno-5-13" href = "#__codelineno-5-13" > < / a > < span class = "w" > < / span > < span class = "kd" > const< / span > < span class = "w" > < / span > < span class = "nx" > vet< / span > < span class = "w" > < / span > < span class = "o" > =< / span > < span class = "w" > < / span > < span class = "nx" > que< / span > < span class = "p" > .< / span > < span class = "nx" > shift< / span > < span class = "p" > ();< / span > < span class = "w" > < / span > < span class = "c1" > // 队首顶点出队< / span >
< a id = "__codelineno-5-14" name = "__codelineno-5-14" href = "#__codelineno-5-14" > < / a > < span class = "w" > < / span > < span class = "nx" > res< / span > < span class = "p" > .< / span > < span class = "nx" > push< / span > < span class = "p" > (< / span > < span class = "nx" > vet< / span > < span class = "p" > );< / span > < span class = "w" > < / span > < span class = "c1" > // 记录访问顶点< / span >
< a id = "__codelineno-5-15" name = "__codelineno-5-15" href = "#__codelineno-5-15" > < / a > < span class = "w" > < / span > < span class = "c1" > // 遍历该顶点的所有邻接顶点< / span >
< a id = "__codelineno-5-16" name = "__codelineno-5-16" href = "#__codelineno-5-16" > < / a > < span class = "w" > < / span > < span class = "k" > for< / span > < span class = "w" > < / span > < span class = "p" > (< / span > < span class = "kd" > const< / span > < span class = "w" > < / span > < span class = "nx" > adjVet< / span > < span class = "w" > < / span > < span class = "k" > of< / span > < span class = "w" > < / span > < span class = "nx" > graph< / span > < span class = "p" > .< / span > < span class = "nx" > adjList< / span > < span class = "p" > .< / span > < span class = "nx" > get< / span > < span class = "p" > (< / span > < span class = "nx" > vet< / span > < span class = "p" > )< / span > < span class = "w" > < / span > < span class = "o" > ??< / span > < span class = "w" > < / span > < span class = "p" > [])< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-5-17" name = "__codelineno-5-17" href = "#__codelineno-5-17" > < / a > < span class = "w" > < / span > < span class = "k" > if< / span > < span class = "w" > < / span > < span class = "p" > (< / span > < span class = "nx" > visited< / span > < span class = "p" > .< / span > < span class = "nx" > has< / span > < span class = "p" > (< / span > < span class = "nx" > adjVet< / span > < span class = "p" > ))< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-5-18" name = "__codelineno-5-18" href = "#__codelineno-5-18" > < / a > < span class = "w" > < / span > < span class = "k" > continue< / span > < span class = "p" > ;< / span > < span class = "w" > < / span > < span class = "c1" > // 跳过已被访问过的顶点< / span >
< a id = "__codelineno-5-19" name = "__codelineno-5-19" href = "#__codelineno-5-19" > < / a > < span class = "w" > < / span > < span class = "p" > }< / span >
< a id = "__codelineno-5-20" name = "__codelineno-5-20" href = "#__codelineno-5-20" > < / a > < span class = "w" > < / span > < span class = "nx" > que< / span > < span class = "p" > .< / span > < span class = "nx" > push< / span > < span class = "p" > (< / span > < span class = "nx" > adjVet< / span > < span class = "p" > );< / span > < span class = "w" > < / span > < span class = "c1" > // 只入队未访问< / span >
< a id = "__codelineno-5-21" name = "__codelineno-5-21" href = "#__codelineno-5-21" > < / a > < span class = "w" > < / span > < span class = "nx" > visited< / span > < span class = "p" > .< / span > < span class = "nx" > add< / span > < span class = "p" > (< / span > < span class = "nx" > adjVet< / span > < span class = "p" > );< / span > < span class = "w" > < / span > < span class = "c1" > // 标记该顶点已被访问< / span >
< a id = "__codelineno-5-22" name = "__codelineno-5-22" href = "#__codelineno-5-22" > < / a > < span class = "w" > < / span > < span class = "p" > }< / span >
< a id = "__codelineno-5-23" name = "__codelineno-5-23" href = "#__codelineno-5-23" > < / a > < span class = "w" > < / span > < span class = "p" > }< / span >
< a id = "__codelineno-5-24" name = "__codelineno-5-24" href = "#__codelineno-5-24" > < / a > < span class = "w" > < / span > < span class = "c1" > // 返回顶点遍历序列< / span >
< a id = "__codelineno-5-25" name = "__codelineno-5-25" href = "#__codelineno-5-25" > < / a > < span class = "w" > < / span > < span class = "k" > return< / span > < span class = "w" > < / span > < span class = "nx" > res< / span > < span class = "p" > ;< / span >
< a id = "__codelineno-5-26" name = "__codelineno-5-26" href = "#__codelineno-5-26" > < / a > < span class = "p" > }< / span >
< / code > < / pre > < / div >
< / div >
< div class = "tabbed-block" >
< div class = "highlight" > < span class = "filename" > graph_bfs.c< / span > < pre > < span > < / span > < code > < a id = "__codelineno-6-1" name = "__codelineno-6-1" href = "#__codelineno-6-1" > < / a > < span class = "p" > [< / span > < span class = "n" > class< / span > < span class = "p" > ]{}< / span > < span class = "o" > -< / span > < span class = "p" > [< / span > < span class = "n" > func< / span > < span class = "p" > ]{< / span > < span class = "n" > graphBFS< / span > < span class = "p" > }< / span >
< / code > < / pre > < / div >
< / div >
< div class = "tabbed-block" >
< div class = "highlight" > < span class = "filename" > graph_bfs.cs< / span > < pre > < span > < / span > < code > < a id = "__codelineno-7-1" name = "__codelineno-7-1" href = "#__codelineno-7-1" > < / a > < span class = "cm" > /* 广度优先遍历 BFS */< / span >
< a id = "__codelineno-7-2" name = "__codelineno-7-2" href = "#__codelineno-7-2" > < / a > < span class = "c1" > // 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点< / span >
< a id = "__codelineno-7-3" name = "__codelineno-7-3" href = "#__codelineno-7-3" > < / a > < span class = "n" > List< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "o" > > < / span > < span class = "w" > < / span > < span class = "n" > graphBFS< / span > < span class = "p" > (< / span > < span class = "n" > GraphAdjList< / span > < span class = "w" > < / span > < span class = "n" > graph< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > Vertex< / span > < span class = "w" > < / span > < span class = "n" > startVet< / span > < span class = "p" > )< / span >
< a id = "__codelineno-7-4" name = "__codelineno-7-4" href = "#__codelineno-7-4" > < / a > < span class = "p" > {< / span >
< a id = "__codelineno-7-5" name = "__codelineno-7-5" href = "#__codelineno-7-5" > < / a > < span class = "w" > < / span > < span class = "c1" > // 顶点遍历序列< / span >
< a id = "__codelineno-7-6" name = "__codelineno-7-6" href = "#__codelineno-7-6" > < / a > < span class = "w" > < / span > < span class = "n" > List< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "o" > > < / span > < span class = "w" > < / span > < span class = "n" > res< / span > < span class = "w" > < / span > < span class = "o" > =< / span > < span class = "w" > < / span > < span class = "k" > new< / span > < span class = "w" > < / span > < span class = "n" > List< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "o" > > < / span > < span class = "p" > ();< / span >
< a id = "__codelineno-7-7" name = "__codelineno-7-7" href = "#__codelineno-7-7" > < / a > < span class = "w" > < / span > < span class = "c1" > // 哈希表，用于记录已被访问过的顶点< / span >
< a id = "__codelineno-7-8" name = "__codelineno-7-8" href = "#__codelineno-7-8" > < / a > < span class = "w" > < / span > < span class = "n" > HashSet< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "o" > > < / span > < span class = "w" > < / span > < span class = "n" > visited< / span > < span class = "w" > < / span > < span class = "o" > =< / span > < span class = "w" > < / span > < span class = "k" > new< / span > < span class = "w" > < / span > < span class = "n" > HashSet< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "o" > > < / span > < span class = "p" > ()< / span > < span class = "w" > < / span > < span class = "p" > {< / span > < span class = "w" > < / span > < span class = "n" > startVet< / span > < span class = "w" > < / span > < span class = "p" > };< / span >
< a id = "__codelineno-7-9" name = "__codelineno-7-9" href = "#__codelineno-7-9" > < / a > < span class = "w" > < / span > < span class = "c1" > // 队列用于实现 BFS< / span >
< a id = "__codelineno-7-10" name = "__codelineno-7-10" href = "#__codelineno-7-10" > < / a > < span class = "w" > < / span > < span class = "n" > Queue< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "o" > > < / span > < span class = "w" > < / span > < span class = "n" > que< / span > < span class = "w" > < / span > < span class = "o" > =< / span > < span class = "w" > < / span > < span class = "k" > new< / span > < span class = "w" > < / span > < span class = "n" > Queue< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "o" > > < / span > < span class = "p" > ();< / span >
< a id = "__codelineno-7-11" name = "__codelineno-7-11" href = "#__codelineno-7-11" > < / a > < span class = "w" > < / span > < span class = "n" > que< / span > < span class = "p" > .< / span > < span class = "n" > Enqueue< / span > < span class = "p" > (< / span > < span class = "n" > startVet< / span > < span class = "p" > );< / span >
< a id = "__codelineno-7-12" name = "__codelineno-7-12" href = "#__codelineno-7-12" > < / a > < span class = "w" > < / span > < span class = "c1" > // 以顶点 vet 为起点，循环直至访问完所有顶点< / span >
< a id = "__codelineno-7-13" name = "__codelineno-7-13" href = "#__codelineno-7-13" > < / a > < span class = "w" > < / span > < span class = "k" > while< / span > < span class = "w" > < / span > < span class = "p" > (< / span > < span class = "n" > que< / span > < span class = "p" > .< / span > < span class = "n" > Count< / span > < span class = "w" > < / span > < span class = "o" > > < / span > < span class = "w" > < / span > < span class = "m" > 0< / span > < span class = "p" > )< / span >
< a id = "__codelineno-7-14" name = "__codelineno-7-14" href = "#__codelineno-7-14" > < / a > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-7-15" name = "__codelineno-7-15" href = "#__codelineno-7-15" > < / a > < span class = "w" > < / span > < span class = "n" > Vertex< / span > < span class = "w" > < / span > < span class = "n" > vet< / span > < span class = "w" > < / span > < span class = "o" > =< / span > < span class = "w" > < / span > < span class = "n" > que< / span > < span class = "p" > .< / span > < span class = "n" > Dequeue< / span > < span class = "p" > ();< / span > < span class = "w" > < / span > < span class = "c1" > // 队首顶点出队< / span >
< a id = "__codelineno-7-16" name = "__codelineno-7-16" href = "#__codelineno-7-16" > < / a > < span class = "w" > < / span > < span class = "n" > res< / span > < span class = "p" > .< / span > < span class = "n" > Add< / span > < span class = "p" > (< / span > < span class = "n" > vet< / span > < span class = "p" > );< / span > < span class = "w" > < / span > < span class = "c1" > // 记录访问顶点< / span >
< a id = "__codelineno-7-17" name = "__codelineno-7-17" href = "#__codelineno-7-17" > < / a > < span class = "w" > < / span > < span class = "k" > foreach< / span > < span class = "w" > < / span > < span class = "p" > (< / span > < span class = "n" > Vertex< / span > < span class = "w" > < / span > < span class = "n" > adjVet< / span > < span class = "w" > < / span > < span class = "k" > in< / span > < span class = "w" > < / span > < span class = "n" > graph< / span > < span class = "p" > .< / span > < span class = "n" > adjList< / span > < span class = "p" > [< / span > < span class = "n" > vet< / span > < span class = "p" > ])< / span >
< a id = "__codelineno-7-18" name = "__codelineno-7-18" href = "#__codelineno-7-18" > < / a > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-7-19" name = "__codelineno-7-19" href = "#__codelineno-7-19" > < / a > < span class = "w" > < / span > < span class = "k" > if< / span > < span class = "w" > < / span > < span class = "p" > (< / span > < span class = "n" > visited< / span > < span class = "p" > .< / span > < span class = "n" > Contains< / span > < span class = "p" > (< / span > < span class = "n" > adjVet< / span > < span class = "p" > ))< / span >
< a id = "__codelineno-7-20" name = "__codelineno-7-20" href = "#__codelineno-7-20" > < / a > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-7-21" name = "__codelineno-7-21" href = "#__codelineno-7-21" > < / a > < span class = "w" > < / span > < span class = "k" > continue< / span > < span class = "p" > ;< / span > < span class = "w" > < / span > < span class = "c1" > // 跳过已被访问过的顶点< / span >
< a id = "__codelineno-7-22" name = "__codelineno-7-22" href = "#__codelineno-7-22" > < / a > < span class = "w" > < / span > < span class = "p" > }< / span >
< a id = "__codelineno-7-23" name = "__codelineno-7-23" href = "#__codelineno-7-23" > < / a > < span class = "w" > < / span > < span class = "n" > que< / span > < span class = "p" > .< / span > < span class = "n" > Enqueue< / span > < span class = "p" > (< / span > < span class = "n" > adjVet< / span > < span class = "p" > );< / span > < span class = "w" > < / span > < span class = "c1" > // 只入队未访问的顶点< / span >
< a id = "__codelineno-7-24" name = "__codelineno-7-24" href = "#__codelineno-7-24" > < / a > < span class = "w" > < / span > < span class = "n" > visited< / span > < span class = "p" > .< / span > < span class = "n" > Add< / span > < span class = "p" > (< / span > < span class = "n" > adjVet< / span > < span class = "p" > );< / span > < span class = "w" > < / span > < span class = "c1" > // 标记该顶点已被访问< / span >
< a id = "__codelineno-7-25" name = "__codelineno-7-25" href = "#__codelineno-7-25" > < / a > < span class = "w" > < / span > < span class = "p" > }< / span >
< a id = "__codelineno-7-26" name = "__codelineno-7-26" href = "#__codelineno-7-26" > < / a > < span class = "w" > < / span > < span class = "p" > }< / span >
< a id = "__codelineno-7-27" name = "__codelineno-7-27" href = "#__codelineno-7-27" > < / a >
< a id = "__codelineno-7-28" name = "__codelineno-7-28" href = "#__codelineno-7-28" > < / a > < span class = "w" > < / span > < span class = "c1" > // 返回顶点遍历序列< / span >
< a id = "__codelineno-7-29" name = "__codelineno-7-29" href = "#__codelineno-7-29" > < / a > < span class = "w" > < / span > < span class = "k" > return< / span > < span class = "w" > < / span > < span class = "n" > res< / span > < span class = "p" > ;< / span >
< a id = "__codelineno-7-30" name = "__codelineno-7-30" href = "#__codelineno-7-30" > < / a > < span class = "p" > }< / span >
< / code > < / pre > < / div >
< / div >
< div class = "tabbed-block" >
< div class = "highlight" > < span class = "filename" > graph_bfs.swift< / span > < pre > < span > < / span > < code > < a id = "__codelineno-8-1" name = "__codelineno-8-1" href = "#__codelineno-8-1" > < / a > < span class = "cm" > /* 广度优先遍历 BFS */< / span >
< a id = "__codelineno-8-2" name = "__codelineno-8-2" href = "#__codelineno-8-2" > < / a > < span class = "c1" > // 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点< / span >
< a id = "__codelineno-8-3" name = "__codelineno-8-3" href = "#__codelineno-8-3" > < / a > < span class = "kd" > func< / span > < span class = "nf" > graphBFS< / span > < span class = "p" > (< / span > < span class = "n" > graph< / span > < span class = "p" > :< / span > < span class = "n" > GraphAdjList< / span > < span class = "p" > ,< / span > < span class = "n" > startVet< / span > < span class = "p" > :< / span > < span class = "n" > Vertex< / span > < span class = "p" > )< / span > < span class = "p" > -> < / span > < span class = "p" > [< / span > < span class = "n" > Vertex< / span > < span class = "p" > ]< / span > < span class = "p" > {< / span >
< a id = "__codelineno-8-4" name = "__codelineno-8-4" href = "#__codelineno-8-4" > < / a > < span class = "c1" > // 顶点遍历序列< / span >
< a id = "__codelineno-8-5" name = "__codelineno-8-5" href = "#__codelineno-8-5" > < / a > < span class = "kd" > var< / span > < span class = "nv" > res< / span > < span class = "p" > :< / span > < span class = "p" > [< / span > < span class = "n" > Vertex< / span > < span class = "p" > ]< / span > < span class = "p" > =< / span > < span class = "p" > []< / span >
< a id = "__codelineno-8-6" name = "__codelineno-8-6" href = "#__codelineno-8-6" > < / a > < span class = "c1" > // 哈希表，用于记录已被访问过的顶点< / span >
< a id = "__codelineno-8-7" name = "__codelineno-8-7" href = "#__codelineno-8-7" > < / a > < span class = "kd" > var< / span > < span class = "nv" > visited< / span > < span class = "p" > :< / span > < span class = "n" > Set< / span > < span class = "p" > < < / span > < span class = "n" > Vertex< / span > < span class = "p" > > < / span > < span class = "p" > =< / span > < span class = "p" > [< / span > < span class = "n" > startVet< / span > < span class = "p" > ]< / span >
< a id = "__codelineno-8-8" name = "__codelineno-8-8" href = "#__codelineno-8-8" > < / a > < span class = "c1" > // 队列用于实现 BFS< / span >
< a id = "__codelineno-8-9" name = "__codelineno-8-9" href = "#__codelineno-8-9" > < / a > < span class = "kd" > var< / span > < span class = "nv" > que< / span > < span class = "p" > :< / span > < span class = "p" > [< / span > < span class = "n" > Vertex< / span > < span class = "p" > ]< / span > < span class = "p" > =< / span > < span class = "p" > [< / span > < span class = "n" > startVet< / span > < span class = "p" > ]< / span >
< a id = "__codelineno-8-10" name = "__codelineno-8-10" href = "#__codelineno-8-10" > < / a > < span class = "c1" > // 以顶点 vet 为起点，循环直至访问完所有顶点< / span >
< a id = "__codelineno-8-11" name = "__codelineno-8-11" href = "#__codelineno-8-11" > < / a > < span class = "k" > while< / span > < span class = "o" > !< / span > < span class = "n" > que< / span > < span class = "p" > .< / span > < span class = "bp" > isEmpty< / span > < span class = "p" > {< / span >
< a id = "__codelineno-8-12" name = "__codelineno-8-12" href = "#__codelineno-8-12" > < / a > < span class = "kd" > let< / span > < span class = "nv" > vet< / span > < span class = "p" > =< / span > < span class = "n" > que< / span > < span class = "p" > .< / span > < span class = "n" > removeFirst< / span > < span class = "p" > ()< / span > < span class = "c1" > // 队首顶点出队< / span >
< a id = "__codelineno-8-13" name = "__codelineno-8-13" href = "#__codelineno-8-13" > < / a > < span class = "n" > res< / span > < span class = "p" > .< / span > < span class = "n" > append< / span > < span class = "p" > (< / span > < span class = "n" > vet< / span > < span class = "p" > )< / span > < span class = "c1" > // 记录访问顶点< / span >
< a id = "__codelineno-8-14" name = "__codelineno-8-14" href = "#__codelineno-8-14" > < / a > < span class = "c1" > // 遍历该顶点的所有邻接顶点< / span >
< a id = "__codelineno-8-15" name = "__codelineno-8-15" href = "#__codelineno-8-15" > < / a > < span class = "k" > for< / span > < span class = "n" > adjVet< / span > < span class = "k" > in< / span > < span class = "n" > graph< / span > < span class = "p" > .< / span > < span class = "n" > adjList< / span > < span class = "p" > [< / span > < span class = "n" > vet< / span > < span class = "p" > ]< / span > < span class = "p" > ??< / span > < span class = "p" > []< / span > < span class = "p" > {< / span >
< a id = "__codelineno-8-16" name = "__codelineno-8-16" href = "#__codelineno-8-16" > < / a > < span class = "k" > if< / span > < span class = "n" > visited< / span > < span class = "p" > .< / span > < span class = "bp" > contains< / span > < span class = "p" > (< / span > < span class = "n" > adjVet< / span > < span class = "p" > )< / span > < span class = "p" > {< / span >
< a id = "__codelineno-8-17" name = "__codelineno-8-17" href = "#__codelineno-8-17" > < / a > < span class = "k" > continue< / span > < span class = "c1" > // 跳过已被访问过的顶点< / span >
< a id = "__codelineno-8-18" name = "__codelineno-8-18" href = "#__codelineno-8-18" > < / a > < span class = "p" > }< / span >
< a id = "__codelineno-8-19" name = "__codelineno-8-19" href = "#__codelineno-8-19" > < / a > < span class = "n" > que< / span > < span class = "p" > .< / span > < span class = "n" > append< / span > < span class = "p" > (< / span > < span class = "n" > adjVet< / span > < span class = "p" > )< / span > < span class = "c1" > // 只入队未访问的顶点< / span >
< a id = "__codelineno-8-20" name = "__codelineno-8-20" href = "#__codelineno-8-20" > < / a > < span class = "n" > visited< / span > < span class = "p" > .< / span > < span class = "bp" > insert< / span > < span class = "p" > (< / span > < span class = "n" > adjVet< / span > < span class = "p" > )< / span > < span class = "c1" > // 标记该顶点已被访问< / span >
< a id = "__codelineno-8-21" name = "__codelineno-8-21" href = "#__codelineno-8-21" > < / a > < span class = "p" > }< / span >
< a id = "__codelineno-8-22" name = "__codelineno-8-22" href = "#__codelineno-8-22" > < / a > < span class = "p" > }< / span >
< a id = "__codelineno-8-23" name = "__codelineno-8-23" href = "#__codelineno-8-23" > < / a > < span class = "c1" > // 返回顶点遍历序列< / span >
< a id = "__codelineno-8-24" name = "__codelineno-8-24" href = "#__codelineno-8-24" > < / a > < span class = "k" > return< / span > < span class = "n" > res< / span >
< a id = "__codelineno-8-25" name = "__codelineno-8-25" href = "#__codelineno-8-25" > < / a > < span class = "p" > }< / span >
< / code > < / pre > < / div >
< / div >
< div class = "tabbed-block" >
< div class = "highlight" > < span class = "filename" > graph_bfs.zig< / span > < pre > < span > < / span > < code > < a id = "__codelineno-9-1" name = "__codelineno-9-1" href = "#__codelineno-9-1" > < / a > < span class = "p" > [< / span > < span class = "n" > class< / span > < span class = "p" > ]{}< / span > < span class = "o" > -< / span > < span class = "p" > [< / span > < span class = "n" > func< / span > < span class = "p" > ]{< / span > < span class = "n" > graphBFS< / span > < span class = "p" > }< / span >
< / code > < / pre > < / div >
< / div >
< / div >
< / div >
< p > 代码相对抽象，建议对照以下动画图示来加深理解。< / p >
< div class = "tabbed-set tabbed-alternate" data-tabs = "2:11" > < input checked = "checked" id = "__tabbed_2_1" name = "__tabbed_2" type = "radio" / > < input id = "__tabbed_2_2" name = "__tabbed_2" type = "radio" / > < input id = "__tabbed_2_3" name = "__tabbed_2" type = "radio" / > < input id = "__tabbed_2_4" name = "__tabbed_2" type = "radio" / > < input id = "__tabbed_2_5" name = "__tabbed_2" type = "radio" / > < input id = "__tabbed_2_6" name = "__tabbed_2" type = "radio" / > < input id = "__tabbed_2_7" name = "__tabbed_2" type = "radio" / > < input id = "__tabbed_2_8" name = "__tabbed_2" type = "radio" / > < input id = "__tabbed_2_9" name = "__tabbed_2" type = "radio" / > < input id = "__tabbed_2_10" name = "__tabbed_2" type = "radio" / > < input id = "__tabbed_2_11" name = "__tabbed_2" type = "radio" / > < div class = "tabbed-labels" > < label for = "__tabbed_2_1" > < 1> < / label > < label for = "__tabbed_2_2" > < 2> < / label > < label for = "__tabbed_2_3" > < 3> < / label > < label for = "__tabbed_2_4" > < 4> < / label > < label for = "__tabbed_2_5" > < 5> < / label > < label for = "__tabbed_2_6" > < 6> < / label > < label for = "__tabbed_2_7" > < 7> < / label > < label for = "__tabbed_2_8" > < 8> < / label > < label for = "__tabbed_2_9" > < 9> < / label > < label for = "__tabbed_2_10" > < 10> < / label > < label for = "__tabbed_2_11" > < 11> < / label > < / div >
< div class = "tabbed-content" >
< div class = "tabbed-block" >
< p > < img alt = "图的广度优先遍历步骤" src = "../graph_traversal.assets/graph_bfs_step1.png" / > < / p >
< / div >
< div class = "tabbed-block" >
< p > < img alt = "graph_bfs_step2" src = "../graph_traversal.assets/graph_bfs_step2.png" / > < / p >
< / div >
< div class = "tabbed-block" >
< p > < img alt = "graph_bfs_step3" src = "../graph_traversal.assets/graph_bfs_step3.png" / > < / p >
< / div >
< div class = "tabbed-block" >
< p > < img alt = "graph_bfs_step4" src = "../graph_traversal.assets/graph_bfs_step4.png" / > < / p >
< / div >
< div class = "tabbed-block" >
< p > < img alt = "graph_bfs_step5" src = "../graph_traversal.assets/graph_bfs_step5.png" / > < / p >
< / div >
< div class = "tabbed-block" >
< p > < img alt = "graph_bfs_step6" src = "../graph_traversal.assets/graph_bfs_step6.png" / > < / p >
< / div >
< div class = "tabbed-block" >
< p > < img alt = "graph_bfs_step7" src = "../graph_traversal.assets/graph_bfs_step7.png" / > < / p >
< / div >
< div class = "tabbed-block" >
< p > < img alt = "graph_bfs_step8" src = "../graph_traversal.assets/graph_bfs_step8.png" / > < / p >
< / div >
< div class = "tabbed-block" >
< p > < img alt = "graph_bfs_step9" src = "../graph_traversal.assets/graph_bfs_step9.png" / > < / p >
< / div >
< div class = "tabbed-block" >
< p > < img alt = "graph_bfs_step10" src = "../graph_traversal.assets/graph_bfs_step10.png" / > < / p >
< / div >
< div class = "tabbed-block" >
< p > < img alt = "graph_bfs_step11" src = "../graph_traversal.assets/graph_bfs_step11.png" / > < / p >
< / div >
< / div >
< / div >
< div class = "admonition question" >
< p class = "admonition-title" > 广度优先遍历的序列是否唯一？< / p >
< p > 不唯一。广度优先遍历只要求按“由近及远”的顺序遍历，< strong > 而多个相同距离的顶点的遍历顺序是允许被任意打乱的< / strong > 。以上图为例，顶点 < span class = "arithmatex" > \(1\)< / span > , < span class = "arithmatex" > \(3\)< / span > 的访问顺序可以交换、顶点 < span class = "arithmatex" > \(2\)< / span > , < span class = "arithmatex" > \(4\)< / span > , < span class = "arithmatex" > \(6\)< / span > 的访问顺序也可以任意交换。< / p >
< / div >
< h3 id = "_2" > 复杂度分析< a class = "headerlink" href = "#_2" title = "Permanent link" > ¶ < / a > < / h3 >
< p > < strong > 时间复杂度：< / strong > 所有顶点都会入队并出队一次，使用 < span class = "arithmatex" > \(O(|V|)\)< / span > 时间；在遍历邻接顶点的过程中，由于是无向图，因此所有边都会被访问 < span class = "arithmatex" > \(2\)< / span > 次，使用 < span class = "arithmatex" > \(O(2|E|)\)< / span > 时间；总体使用 < span class = "arithmatex" > \(O(|V| + |E|)\)< / span > 时间。< / p >
< p > < strong > 空间复杂度：< / strong > 列表 < code > res< / code > ，哈希表 < code > visited< / code > ，队列 < code > que< / code > 中的顶点数量最多为 < span class = "arithmatex" > \(|V|\)< / span > ，使用 < span class = "arithmatex" > \(O(|V|)\)< / span > 空间。< / p >
< h2 id = "1032" > 10.3.2. 深度优先遍历< a class = "headerlink" href = "#1032" title = "Permanent link" > ¶ < / a > < / h2 >
< p > < strong > 深度优先遍历是一种优先走到底、无路可走再回头的遍历方式< / strong > 。具体地，从某个顶点出发，访问当前顶点的某个邻接顶点，直到走到尽头时返回，再继续走到尽头并返回，以此类推，直至所有顶点遍历完成。< / p >
< p > < img alt = "图的深度优先遍历" src = "../graph_traversal.assets/graph_dfs.png" / > < / p >
< p align = "center" > Fig. 图的深度优先遍历 < / p >
< h3 id = "_3" > 算法实现< a class = "headerlink" href = "#_3" title = "Permanent link" > ¶ < / a > < / h3 >
< p > 这种“走到尽头 + 回溯”的算法形式通常基于递归来实现。与 BFS 类似，在 DFS 中我们也需要借助一个哈希表 < code > visited< / code > 来记录已被访问的顶点，以避免重复访问顶点。< / p >
< div class = "tabbed-set tabbed-alternate" data-tabs = "3:10" > < input checked = "checked" id = "__tabbed_3_1" name = "__tabbed_3" type = "radio" / > < input id = "__tabbed_3_2" name = "__tabbed_3" type = "radio" / > < input id = "__tabbed_3_3" name = "__tabbed_3" type = "radio" / > < input id = "__tabbed_3_4" name = "__tabbed_3" type = "radio" / > < input id = "__tabbed_3_5" name = "__tabbed_3" type = "radio" / > < input id = "__tabbed_3_6" name = "__tabbed_3" type = "radio" / > < input id = "__tabbed_3_7" name = "__tabbed_3" type = "radio" / > < input id = "__tabbed_3_8" name = "__tabbed_3" type = "radio" / > < input id = "__tabbed_3_9" name = "__tabbed_3" type = "radio" / > < input id = "__tabbed_3_10" name = "__tabbed_3" type = "radio" / > < div class = "tabbed-labels" > < label for = "__tabbed_3_1" > Java< / label > < label for = "__tabbed_3_2" > C++< / label > < label for = "__tabbed_3_3" > Python< / label > < label for = "__tabbed_3_4" > Go< / label > < label for = "__tabbed_3_5" > JavaScript< / label > < label for = "__tabbed_3_6" > TypeScript< / label > < label for = "__tabbed_3_7" > C< / label > < label for = "__tabbed_3_8" > C#< / label > < label for = "__tabbed_3_9" > Swift< / label > < label for = "__tabbed_3_10" > Zig< / label > < / div >
< div class = "tabbed-content" >
< div class = "tabbed-block" >
< div class = "highlight" > < span class = "filename" > graph_dfs.java< / span > < pre > < span > < / span > < code > < a id = "__codelineno-10-1" name = "__codelineno-10-1" href = "#__codelineno-10-1" > < / a > < span class = "cm" > /* 深度优先遍历 DFS 辅助函数 */< / span >
< a id = "__codelineno-10-2" name = "__codelineno-10-2" href = "#__codelineno-10-2" > < / a > < span class = "kt" > void< / span > < span class = "w" > < / span > < span class = "nf" > dfs< / span > < span class = "p" > (< / span > < span class = "n" > GraphAdjList< / span > < span class = "w" > < / span > < span class = "n" > graph< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > Set< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "o" > > < / span > < span class = "w" > < / span > < span class = "n" > visited< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > List< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "o" > > < / span > < span class = "w" > < / span > < span class = "n" > res< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > Vertex< / span > < span class = "w" > < / span > < span class = "n" > vet< / span > < span class = "p" > )< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-10-3" name = "__codelineno-10-3" href = "#__codelineno-10-3" > < / a > < span class = "w" > < / span > < span class = "n" > res< / span > < span class = "p" > .< / span > < span class = "na" > add< / span > < span class = "p" > (< / span > < span class = "n" > vet< / span > < span class = "p" > );< / span > < span class = "w" > < / span > < span class = "c1" > // 记录访问顶点< / span >
< a id = "__codelineno-10-4" name = "__codelineno-10-4" href = "#__codelineno-10-4" > < / a > < span class = "w" > < / span > < span class = "n" > visited< / span > < span class = "p" > .< / span > < span class = "na" > add< / span > < span class = "p" > (< / span > < span class = "n" > vet< / span > < span class = "p" > );< / span > < span class = "w" > < / span > < span class = "c1" > // 标记该顶点已被访问< / span >
< a id = "__codelineno-10-5" name = "__codelineno-10-5" href = "#__codelineno-10-5" > < / a > < span class = "w" > < / span > < span class = "c1" > // 遍历该顶点的所有邻接顶点< / span >
< a id = "__codelineno-10-6" name = "__codelineno-10-6" href = "#__codelineno-10-6" > < / a > < span class = "w" > < / span > < span class = "k" > for< / span > < span class = "w" > < / span > < span class = "p" > (< / span > < span class = "n" > Vertex< / span > < span class = "w" > < / span > < span class = "n" > adjVet< / span > < span class = "w" > < / span > < span class = "p" > :< / span > < span class = "w" > < / span > < span class = "n" > graph< / span > < span class = "p" > .< / span > < span class = "na" > adjList< / span > < span class = "p" > .< / span > < span class = "na" > get< / span > < span class = "p" > (< / span > < span class = "n" > vet< / span > < span class = "p" > ))< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-10-7" name = "__codelineno-10-7" href = "#__codelineno-10-7" > < / a > < span class = "w" > < / span > < span class = "k" > if< / span > < span class = "w" > < / span > < span class = "p" > (< / span > < span class = "n" > visited< / span > < span class = "p" > .< / span > < span class = "na" > contains< / span > < span class = "p" > (< / span > < span class = "n" > adjVet< / span > < span class = "p" > ))< / span >
< a id = "__codelineno-10-8" name = "__codelineno-10-8" href = "#__codelineno-10-8" > < / a > < span class = "w" > < / span > < span class = "k" > continue< / span > < span class = "p" > ;< / span > < span class = "w" > < / span > < span class = "c1" > // 跳过已被访问过的顶点< / span >
< a id = "__codelineno-10-9" name = "__codelineno-10-9" href = "#__codelineno-10-9" > < / a > < span class = "w" > < / span > < span class = "c1" > // 递归访问邻接顶点< / span >
< a id = "__codelineno-10-10" name = "__codelineno-10-10" href = "#__codelineno-10-10" > < / a > < span class = "w" > < / span > < span class = "n" > dfs< / span > < span class = "p" > (< / span > < span class = "n" > graph< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > visited< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > res< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > adjVet< / span > < span class = "p" > );< / span >
< a id = "__codelineno-10-11" name = "__codelineno-10-11" href = "#__codelineno-10-11" > < / a > < span class = "w" > < / span > < span class = "p" > }< / span >
< a id = "__codelineno-10-12" name = "__codelineno-10-12" href = "#__codelineno-10-12" > < / a > < span class = "p" > }< / span >
< a id = "__codelineno-10-13" name = "__codelineno-10-13" href = "#__codelineno-10-13" > < / a >
< a id = "__codelineno-10-14" name = "__codelineno-10-14" href = "#__codelineno-10-14" > < / a > < span class = "cm" > /* 深度优先遍历 DFS */< / span >
< a id = "__codelineno-10-15" name = "__codelineno-10-15" href = "#__codelineno-10-15" > < / a > < span class = "c1" > // 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点< / span >
< a id = "__codelineno-10-16" name = "__codelineno-10-16" href = "#__codelineno-10-16" > < / a > < span class = "n" > List< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "o" > > < / span > < span class = "w" > < / span > < span class = "nf" > graphDFS< / span > < span class = "p" > (< / span > < span class = "n" > GraphAdjList< / span > < span class = "w" > < / span > < span class = "n" > graph< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > Vertex< / span > < span class = "w" > < / span > < span class = "n" > startVet< / span > < span class = "p" > )< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-10-17" name = "__codelineno-10-17" href = "#__codelineno-10-17" > < / a > < span class = "w" > < / span > < span class = "c1" > // 顶点遍历序列< / span >
< a id = "__codelineno-10-18" name = "__codelineno-10-18" href = "#__codelineno-10-18" > < / a > < span class = "w" > < / span > < span class = "n" > List< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "o" > > < / span > < span class = "w" > < / span > < span class = "n" > res< / span > < span class = "w" > < / span > < span class = "o" > =< / span > < span class = "w" > < / span > < span class = "k" > new< / span > < span class = "w" > < / span > < span class = "n" > ArrayList< / span > < span class = "o" > < > < / span > < span class = "p" > ();< / span >
< a id = "__codelineno-10-19" name = "__codelineno-10-19" href = "#__codelineno-10-19" > < / a > < span class = "w" > < / span > < span class = "c1" > // 哈希表，用于记录已被访问过的顶点< / span >
< a id = "__codelineno-10-20" name = "__codelineno-10-20" href = "#__codelineno-10-20" > < / a > < span class = "w" > < / span > < span class = "n" > Set< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "o" > > < / span > < span class = "w" > < / span > < span class = "n" > visited< / span > < span class = "w" > < / span > < span class = "o" > =< / span > < span class = "w" > < / span > < span class = "k" > new< / span > < span class = "w" > < / span > < span class = "n" > HashSet< / span > < span class = "o" > < > < / span > < span class = "p" > ();< / span >
< a id = "__codelineno-10-21" name = "__codelineno-10-21" href = "#__codelineno-10-21" > < / a > < span class = "w" > < / span > < span class = "n" > dfs< / span > < span class = "p" > (< / span > < span class = "n" > graph< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > visited< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > res< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > startVet< / span > < span class = "p" > );< / span >
< a id = "__codelineno-10-22" name = "__codelineno-10-22" href = "#__codelineno-10-22" > < / a > < span class = "w" > < / span > < span class = "k" > return< / span > < span class = "w" > < / span > < span class = "n" > res< / span > < span class = "p" > ;< / span >
< a id = "__codelineno-10-23" name = "__codelineno-10-23" href = "#__codelineno-10-23" > < / a > < span class = "p" > }< / span >
< / code > < / pre > < / div >
< / div >
< div class = "tabbed-block" >
< div class = "highlight" > < span class = "filename" > graph_dfs.cpp< / span > < pre > < span > < / span > < code > < a id = "__codelineno-11-1" name = "__codelineno-11-1" href = "#__codelineno-11-1" > < / a > < span class = "cm" > /* 深度优先遍历 DFS 辅助函数 */< / span >
< a id = "__codelineno-11-2" name = "__codelineno-11-2" href = "#__codelineno-11-2" > < / a > < span class = "kt" > void< / span > < span class = "w" > < / span > < span class = "nf" > dfs< / span > < span class = "p" > (< / span > < span class = "n" > GraphAdjList< / span > < span class = "w" > < / span > < span class = "o" > & < / span > < span class = "n" > graph< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > unordered_set< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "w" > < / span > < span class = "o" > *> < / span > < span class = "w" > < / span > < span class = "o" > & < / span > < span class = "n" > visited< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > vector< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "w" > < / span > < span class = "o" > *> < / span > < span class = "w" > < / span > < span class = "o" > & < / span > < span class = "n" > res< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > Vertex< / span > < span class = "w" > < / span > < span class = "o" > *< / span > < span class = "n" > vet< / span > < span class = "p" > )< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-11-3" name = "__codelineno-11-3" href = "#__codelineno-11-3" > < / a > < span class = "w" > < / span > < span class = "n" > res< / span > < span class = "p" > .< / span > < span class = "n" > push_back< / span > < span class = "p" > (< / span > < span class = "n" > vet< / span > < span class = "p" > );< / span > < span class = "w" > < / span > < span class = "c1" > // 记录访问顶点< / span >
< a id = "__codelineno-11-4" name = "__codelineno-11-4" href = "#__codelineno-11-4" > < / a > < span class = "w" > < / span > < span class = "n" > visited< / span > < span class = "p" > .< / span > < span class = "n" > emplace< / span > < span class = "p" > (< / span > < span class = "n" > vet< / span > < span class = "p" > );< / span > < span class = "w" > < / span > < span class = "c1" > // 标记该顶点已被访问< / span >
< a id = "__codelineno-11-5" name = "__codelineno-11-5" href = "#__codelineno-11-5" > < / a > < span class = "w" > < / span > < span class = "c1" > // 遍历该顶点的所有邻接顶点< / span >
< a id = "__codelineno-11-6" name = "__codelineno-11-6" href = "#__codelineno-11-6" > < / a > < span class = "w" > < / span > < span class = "k" > for< / span > < span class = "w" > < / span > < span class = "p" > (< / span > < span class = "n" > Vertex< / span > < span class = "w" > < / span > < span class = "o" > *< / span > < span class = "n" > adjVet< / span > < span class = "w" > < / span > < span class = "o" > :< / span > < span class = "w" > < / span > < span class = "n" > graph< / span > < span class = "p" > .< / span > < span class = "n" > adjList< / span > < span class = "p" > [< / span > < span class = "n" > vet< / span > < span class = "p" > ])< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-11-7" name = "__codelineno-11-7" href = "#__codelineno-11-7" > < / a > < span class = "w" > < / span > < span class = "k" > if< / span > < span class = "w" > < / span > < span class = "p" > (< / span > < span class = "n" > visited< / span > < span class = "p" > .< / span > < span class = "n" > count< / span > < span class = "p" > (< / span > < span class = "n" > adjVet< / span > < span class = "p" > ))< / span >
< a id = "__codelineno-11-8" name = "__codelineno-11-8" href = "#__codelineno-11-8" > < / a > < span class = "w" > < / span > < span class = "k" > continue< / span > < span class = "p" > ;< / span > < span class = "w" > < / span > < span class = "c1" > // 跳过已被访问过的顶点< / span >
< a id = "__codelineno-11-9" name = "__codelineno-11-9" href = "#__codelineno-11-9" > < / a > < span class = "w" > < / span > < span class = "c1" > // 递归访问邻接顶点< / span >
< a id = "__codelineno-11-10" name = "__codelineno-11-10" href = "#__codelineno-11-10" > < / a > < span class = "w" > < / span > < span class = "n" > dfs< / span > < span class = "p" > (< / span > < span class = "n" > graph< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > visited< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > res< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > adjVet< / span > < span class = "p" > );< / span >
< a id = "__codelineno-11-11" name = "__codelineno-11-11" href = "#__codelineno-11-11" > < / a > < span class = "w" > < / span > < span class = "p" > }< / span >
< a id = "__codelineno-11-12" name = "__codelineno-11-12" href = "#__codelineno-11-12" > < / a > < span class = "p" > }< / span >
< a id = "__codelineno-11-13" name = "__codelineno-11-13" href = "#__codelineno-11-13" > < / a >
< a id = "__codelineno-11-14" name = "__codelineno-11-14" href = "#__codelineno-11-14" > < / a > < span class = "cm" > /* 深度优先遍历 DFS */< / span >
< a id = "__codelineno-11-15" name = "__codelineno-11-15" href = "#__codelineno-11-15" > < / a > < span class = "c1" > // 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点< / span >
< a id = "__codelineno-11-16" name = "__codelineno-11-16" href = "#__codelineno-11-16" > < / a > < span class = "n" > vector< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "w" > < / span > < span class = "o" > *> < / span > < span class = "w" > < / span > < span class = "n" > graphDFS< / span > < span class = "p" > (< / span > < span class = "n" > GraphAdjList< / span > < span class = "w" > < / span > < span class = "o" > & < / span > < span class = "n" > graph< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > Vertex< / span > < span class = "w" > < / span > < span class = "o" > *< / span > < span class = "n" > startVet< / span > < span class = "p" > )< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-11-17" name = "__codelineno-11-17" href = "#__codelineno-11-17" > < / a > < span class = "w" > < / span > < span class = "c1" > // 顶点遍历序列< / span >
< a id = "__codelineno-11-18" name = "__codelineno-11-18" href = "#__codelineno-11-18" > < / a > < span class = "w" > < / span > < span class = "n" > vector< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "w" > < / span > < span class = "o" > *> < / span > < span class = "w" > < / span > < span class = "n" > res< / span > < span class = "p" > ;< / span >
< a id = "__codelineno-11-19" name = "__codelineno-11-19" href = "#__codelineno-11-19" > < / a > < span class = "w" > < / span > < span class = "c1" > // 哈希表，用于记录已被访问过的顶点< / span >
< a id = "__codelineno-11-20" name = "__codelineno-11-20" href = "#__codelineno-11-20" > < / a > < span class = "w" > < / span > < span class = "n" > unordered_set< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "w" > < / span > < span class = "o" > *> < / span > < span class = "w" > < / span > < span class = "n" > visited< / span > < span class = "p" > ;< / span >
< a id = "__codelineno-11-21" name = "__codelineno-11-21" href = "#__codelineno-11-21" > < / a > < span class = "w" > < / span > < span class = "n" > dfs< / span > < span class = "p" > (< / span > < span class = "n" > graph< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > visited< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > res< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > startVet< / span > < span class = "p" > );< / span >
< a id = "__codelineno-11-22" name = "__codelineno-11-22" href = "#__codelineno-11-22" > < / a > < span class = "w" > < / span > < span class = "k" > return< / span > < span class = "w" > < / span > < span class = "n" > res< / span > < span class = "p" > ;< / span >
< a id = "__codelineno-11-23" name = "__codelineno-11-23" href = "#__codelineno-11-23" > < / a > < span class = "p" > }< / span >
< / code > < / pre > < / div >
< / div >
< div class = "tabbed-block" >
< div class = "highlight" > < span class = "filename" > graph_dfs.py< / span > < pre > < span > < / span > < code > < a id = "__codelineno-12-1" name = "__codelineno-12-1" href = "#__codelineno-12-1" > < / a > < span class = "k" > def< / span > < span class = "nf" > dfs< / span > < span class = "p" > (< / span > < span class = "n" > graph< / span > < span class = "p" > :< / span > < span class = "n" > GraphAdjList< / span > < span class = "p" > ,< / span > < span class = "n" > visited< / span > < span class = "p" > :< / span > < span class = "nb" > set< / span > < span class = "p" > [< / span > < span class = "n" > Vertex< / span > < span class = "p" > ],< / span > < span class = "n" > res< / span > < span class = "p" > :< / span > < span class = "nb" > list< / span > < span class = "p" > [< / span > < span class = "n" > Vertex< / span > < span class = "p" > ],< / span > < span class = "n" > vet< / span > < span class = "p" > :< / span > < span class = "n" > Vertex< / span > < span class = "p" > ):< / span >
< a id = "__codelineno-12-2" name = "__codelineno-12-2" href = "#__codelineno-12-2" > < / a > < span class = "w" > < / span > < span class = "sd" > " " " 深度优先遍历 DFS 辅助函数" " " < / span >
< a id = "__codelineno-12-3" name = "__codelineno-12-3" href = "#__codelineno-12-3" > < / a > < span class = "n" > res< / span > < span class = "o" > .< / span > < span class = "n" > append< / span > < span class = "p" > (< / span > < span class = "n" > vet< / span > < span class = "p" > )< / span > < span class = "c1" > # 记录访问顶点< / span >
< a id = "__codelineno-12-4" name = "__codelineno-12-4" href = "#__codelineno-12-4" > < / a > < span class = "n" > visited< / span > < span class = "o" > .< / span > < span class = "n" > add< / span > < span class = "p" > (< / span > < span class = "n" > vet< / span > < span class = "p" > )< / span > < span class = "c1" > # 标记该顶点已被访问< / span >
< a id = "__codelineno-12-5" name = "__codelineno-12-5" href = "#__codelineno-12-5" > < / a > < span class = "c1" > # 遍历该顶点的所有邻接顶点< / span >
< a id = "__codelineno-12-6" name = "__codelineno-12-6" href = "#__codelineno-12-6" > < / a > < span class = "k" > for< / span > < span class = "n" > adjVet< / span > < span class = "ow" > in< / span > < span class = "n" > graph< / span > < span class = "o" > .< / span > < span class = "n" > adj_list< / span > < span class = "p" > [< / span > < span class = "n" > vet< / span > < span class = "p" > ]:< / span >
< a id = "__codelineno-12-7" name = "__codelineno-12-7" href = "#__codelineno-12-7" > < / a > < span class = "k" > if< / span > < span class = "n" > adjVet< / span > < span class = "ow" > in< / span > < span class = "n" > visited< / span > < span class = "p" > :< / span >
< a id = "__codelineno-12-8" name = "__codelineno-12-8" href = "#__codelineno-12-8" > < / a > < span class = "k" > continue< / span > < span class = "c1" > # 跳过已被访问过的顶点< / span >
< a id = "__codelineno-12-9" name = "__codelineno-12-9" href = "#__codelineno-12-9" > < / a > < span class = "c1" > # 递归访问邻接顶点< / span >
< a id = "__codelineno-12-10" name = "__codelineno-12-10" href = "#__codelineno-12-10" > < / a > < span class = "n" > dfs< / span > < span class = "p" > (< / span > < span class = "n" > graph< / span > < span class = "p" > ,< / span > < span class = "n" > visited< / span > < span class = "p" > ,< / span > < span class = "n" > res< / span > < span class = "p" > ,< / span > < span class = "n" > adjVet< / span > < span class = "p" > )< / span >
< a id = "__codelineno-12-11" name = "__codelineno-12-11" href = "#__codelineno-12-11" > < / a >
< a id = "__codelineno-12-12" name = "__codelineno-12-12" href = "#__codelineno-12-12" > < / a > < span class = "k" > def< / span > < span class = "nf" > graph_dfs< / span > < span class = "p" > (< / span > < span class = "n" > graph< / span > < span class = "p" > :< / span > < span class = "n" > GraphAdjList< / span > < span class = "p" > ,< / span > < span class = "n" > start_vet< / span > < span class = "p" > :< / span > < span class = "n" > Vertex< / span > < span class = "p" > )< / span > < span class = "o" > -> < / span > < span class = "nb" > list< / span > < span class = "p" > [< / span > < span class = "n" > Vertex< / span > < span class = "p" > ]:< / span >
< a id = "__codelineno-12-13" name = "__codelineno-12-13" href = "#__codelineno-12-13" > < / a > < span class = "w" > < / span > < span class = "sd" > " " " 深度优先遍历 DFS" " " < / span >
< a id = "__codelineno-12-14" name = "__codelineno-12-14" href = "#__codelineno-12-14" > < / a > < span class = "c1" > # 顶点遍历序列< / span >
< a id = "__codelineno-12-15" name = "__codelineno-12-15" href = "#__codelineno-12-15" > < / a > < span class = "n" > res< / span > < span class = "o" > =< / span > < span class = "p" > []< / span >
< a id = "__codelineno-12-16" name = "__codelineno-12-16" href = "#__codelineno-12-16" > < / a > < span class = "c1" > # 哈希表，用于记录已被访问过的顶点< / span >
< a id = "__codelineno-12-17" name = "__codelineno-12-17" href = "#__codelineno-12-17" > < / a > < span class = "n" > visited< / span > < span class = "o" > =< / span > < span class = "nb" > set< / span > < span class = "p" > [< / span > < span class = "n" > Vertex< / span > < span class = "p" > ]()< / span >
< a id = "__codelineno-12-18" name = "__codelineno-12-18" href = "#__codelineno-12-18" > < / a > < span class = "n" > dfs< / span > < span class = "p" > (< / span > < span class = "n" > graph< / span > < span class = "p" > ,< / span > < span class = "n" > visited< / span > < span class = "p" > ,< / span > < span class = "n" > res< / span > < span class = "p" > ,< / span > < span class = "n" > start_vet< / span > < span class = "p" > )< / span >
< a id = "__codelineno-12-19" name = "__codelineno-12-19" href = "#__codelineno-12-19" > < / a > < span class = "k" > return< / span > < span class = "n" > res< / span >
< / code > < / pre > < / div >
< / div >
< div class = "tabbed-block" >
< div class = "highlight" > < span class = "filename" > graph_dfs.go< / span > < pre > < span > < / span > < code > < a id = "__codelineno-13-1" name = "__codelineno-13-1" href = "#__codelineno-13-1" > < / a > < span class = "cm" > /* 深度优先遍历 DFS 辅助函数 */< / span >
< a id = "__codelineno-13-2" name = "__codelineno-13-2" href = "#__codelineno-13-2" > < / a > < span class = "kd" > func< / span > < span class = "w" > < / span > < span class = "nx" > dfs< / span > < span class = "p" > (< / span > < span class = "nx" > g< / span > < span class = "w" > < / span > < span class = "o" > *< / span > < span class = "nx" > graphAdjList< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > visited< / span > < span class = "w" > < / span > < span class = "kd" > map< / span > < span class = "p" > [< / span > < span class = "nx" > Vertex< / span > < span class = "p" > ]< / span > < span class = "kd" > struct< / span > < span class = "p" > {},< / span > < span class = "w" > < / span > < span class = "nx" > res< / span > < span class = "w" > < / span > < span class = "o" > *< / span > < span class = "p" > []< / span > < span class = "nx" > Vertex< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > vet< / span > < span class = "w" > < / span > < span class = "nx" > Vertex< / span > < span class = "p" > )< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-13-3" name = "__codelineno-13-3" href = "#__codelineno-13-3" > < / a > < span class = "w" > < / span > < span class = "c1" > // append 操作会返回新的的引用， < / span >
< a id = "__codelineno-13-4" name = "__codelineno-13-4" href = "#__codelineno-13-4" > < / a > < span class = "w" > < / span > < span class = "o" > *< / span > < span class = "nx" > res< / span > < span class = "w" > < / span > < span class = "p" > =< / span > < span class = "w" > < / span > < span class = "nb" > append< / span > < span class = "p" > (< / span > < span class = "o" > *< / span > < span class = "nx" > res< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > vet< / span > < span class = "p" > )< / span >
< a id = "__codelineno-13-5" name = "__codelineno-13-5" href = "#__codelineno-13-5" > < / a > < span class = "w" > < / span > < span class = "nx" > visited< / span > < span class = "p" > [< / span > < span class = "nx" > vet< / span > < span class = "p" > ]< / span > < span class = "w" > < / span > < span class = "p" > =< / span > < span class = "w" > < / span > < span class = "kd" > struct< / span > < span class = "p" > {}{}< / span >
< a id = "__codelineno-13-6" name = "__codelineno-13-6" href = "#__codelineno-13-6" > < / a > < span class = "w" > < / span > < span class = "c1" > // 遍历该顶点的所有邻接顶点< / span >
< a id = "__codelineno-13-7" name = "__codelineno-13-7" href = "#__codelineno-13-7" > < / a > < span class = "w" > < / span > < span class = "k" > for< / span > < span class = "w" > < / span > < span class = "nx" > _< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > adjVet< / span > < span class = "w" > < / span > < span class = "o" > :=< / span > < span class = "w" > < / span > < span class = "k" > range< / span > < span class = "w" > < / span > < span class = "nx" > g< / span > < span class = "p" > .< / span > < span class = "nx" > adjList< / span > < span class = "p" > [< / span > < span class = "nx" > vet< / span > < span class = "p" > ]< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-13-8" name = "__codelineno-13-8" href = "#__codelineno-13-8" > < / a > < span class = "w" > < / span > < span class = "nx" > _< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > isExist< / span > < span class = "w" > < / span > < span class = "o" > :=< / span > < span class = "w" > < / span > < span class = "nx" > visited< / span > < span class = "p" > [< / span > < span class = "nx" > adjVet< / span > < span class = "p" > ]< / span >
< a id = "__codelineno-13-9" name = "__codelineno-13-9" href = "#__codelineno-13-9" > < / a > < span class = "w" > < / span > < span class = "c1" > // 递归访问邻接顶点< / span >
< a id = "__codelineno-13-10" name = "__codelineno-13-10" href = "#__codelineno-13-10" > < / a > < span class = "w" > < / span > < span class = "k" > if< / span > < span class = "w" > < / span > < span class = "p" > !< / span > < span class = "nx" > isExist< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-13-11" name = "__codelineno-13-11" href = "#__codelineno-13-11" > < / a > < span class = "w" > < / span > < span class = "nx" > dfs< / span > < span class = "p" > (< / span > < span class = "nx" > g< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > visited< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > res< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > adjVet< / span > < span class = "p" > )< / span >
< a id = "__codelineno-13-12" name = "__codelineno-13-12" href = "#__codelineno-13-12" > < / a > < span class = "w" > < / span > < span class = "p" > }< / span >
< a id = "__codelineno-13-13" name = "__codelineno-13-13" href = "#__codelineno-13-13" > < / a > < span class = "w" > < / span > < span class = "p" > }< / span >
< a id = "__codelineno-13-14" name = "__codelineno-13-14" href = "#__codelineno-13-14" > < / a > < span class = "p" > }< / span >
< a id = "__codelineno-13-15" name = "__codelineno-13-15" href = "#__codelineno-13-15" > < / a >
< a id = "__codelineno-13-16" name = "__codelineno-13-16" href = "#__codelineno-13-16" > < / a > < span class = "cm" > /* 深度优先遍历 DFS */< / span >
< a id = "__codelineno-13-17" name = "__codelineno-13-17" href = "#__codelineno-13-17" > < / a > < span class = "c1" > // 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点< / span >
< a id = "__codelineno-13-18" name = "__codelineno-13-18" href = "#__codelineno-13-18" > < / a > < span class = "kd" > func< / span > < span class = "w" > < / span > < span class = "nx" > graphDFS< / span > < span class = "p" > (< / span > < span class = "nx" > g< / span > < span class = "w" > < / span > < span class = "o" > *< / span > < span class = "nx" > graphAdjList< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > startVet< / span > < span class = "w" > < / span > < span class = "nx" > Vertex< / span > < span class = "p" > )< / span > < span class = "w" > < / span > < span class = "p" > []< / span > < span class = "nx" > Vertex< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-13-19" name = "__codelineno-13-19" href = "#__codelineno-13-19" > < / a > < span class = "w" > < / span > < span class = "c1" > // 顶点遍历序列< / span >
< a id = "__codelineno-13-20" name = "__codelineno-13-20" href = "#__codelineno-13-20" > < / a > < span class = "w" > < / span > < span class = "nx" > res< / span > < span class = "w" > < / span > < span class = "o" > :=< / span > < span class = "w" > < / span > < span class = "nb" > make< / span > < span class = "p" > ([]< / span > < span class = "nx" > Vertex< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "mi" > 0< / span > < span class = "p" > )< / span >
< a id = "__codelineno-13-21" name = "__codelineno-13-21" href = "#__codelineno-13-21" > < / a > < span class = "w" > < / span > < span class = "c1" > // 哈希表，用于记录已被访问过的顶点< / span >
< a id = "__codelineno-13-22" name = "__codelineno-13-22" href = "#__codelineno-13-22" > < / a > < span class = "w" > < / span > < span class = "nx" > visited< / span > < span class = "w" > < / span > < span class = "o" > :=< / span > < span class = "w" > < / span > < span class = "nb" > make< / span > < span class = "p" > (< / span > < span class = "kd" > map< / span > < span class = "p" > [< / span > < span class = "nx" > Vertex< / span > < span class = "p" > ]< / span > < span class = "kd" > struct< / span > < span class = "p" > {})< / span >
< a id = "__codelineno-13-23" name = "__codelineno-13-23" href = "#__codelineno-13-23" > < / a > < span class = "w" > < / span > < span class = "nx" > dfs< / span > < span class = "p" > (< / span > < span class = "nx" > g< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > visited< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "o" > & < / span > < span class = "nx" > res< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > startVet< / span > < span class = "p" > )< / span >
< a id = "__codelineno-13-24" name = "__codelineno-13-24" href = "#__codelineno-13-24" > < / a > < span class = "w" > < / span > < span class = "c1" > // 返回顶点遍历序列< / span >
< a id = "__codelineno-13-25" name = "__codelineno-13-25" href = "#__codelineno-13-25" > < / a > < span class = "w" > < / span > < span class = "k" > return< / span > < span class = "w" > < / span > < span class = "nx" > res< / span >
< a id = "__codelineno-13-26" name = "__codelineno-13-26" href = "#__codelineno-13-26" > < / a > < span class = "p" > }< / span >
< / code > < / pre > < / div >
< / div >
< div class = "tabbed-block" >
< div class = "highlight" > < span class = "filename" > graph_dfs.js< / span > < pre > < span > < / span > < code > < a id = "__codelineno-14-1" name = "__codelineno-14-1" href = "#__codelineno-14-1" > < / a > < span class = "cm" > /* 深度优先遍历 DFS */< / span >
< a id = "__codelineno-14-2" name = "__codelineno-14-2" href = "#__codelineno-14-2" > < / a > < span class = "c1" > // 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点< / span >
< a id = "__codelineno-14-3" name = "__codelineno-14-3" href = "#__codelineno-14-3" > < / a > < span class = "kd" > function< / span > < span class = "w" > < / span > < span class = "nx" > dfs< / span > < span class = "p" > (< / span > < span class = "nx" > graph< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > visited< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > res< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > vet< / span > < span class = "p" > )< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-14-4" name = "__codelineno-14-4" href = "#__codelineno-14-4" > < / a > < span class = "w" > < / span > < span class = "nx" > res< / span > < span class = "p" > .< / span > < span class = "nx" > push< / span > < span class = "p" > (< / span > < span class = "nx" > vet< / span > < span class = "p" > );< / span > < span class = "w" > < / span > < span class = "c1" > // 记录访问顶点< / span >
< a id = "__codelineno-14-5" name = "__codelineno-14-5" href = "#__codelineno-14-5" > < / a > < span class = "w" > < / span > < span class = "nx" > visited< / span > < span class = "p" > .< / span > < span class = "nx" > add< / span > < span class = "p" > (< / span > < span class = "nx" > vet< / span > < span class = "p" > );< / span > < span class = "w" > < / span > < span class = "c1" > // 标记该顶点已被访问< / span >
< a id = "__codelineno-14-6" name = "__codelineno-14-6" href = "#__codelineno-14-6" > < / a > < span class = "w" > < / span > < span class = "c1" > // 遍历该顶点的所有邻接顶点< / span >
< a id = "__codelineno-14-7" name = "__codelineno-14-7" href = "#__codelineno-14-7" > < / a > < span class = "w" > < / span > < span class = "k" > for< / span > < span class = "w" > < / span > < span class = "p" > (< / span > < span class = "kd" > const< / span > < span class = "w" > < / span > < span class = "nx" > adjVet< / span > < span class = "w" > < / span > < span class = "k" > of< / span > < span class = "w" > < / span > < span class = "nx" > graph< / span > < span class = "p" > .< / span > < span class = "nx" > adjList< / span > < span class = "p" > .< / span > < span class = "nx" > get< / span > < span class = "p" > (< / span > < span class = "nx" > vet< / span > < span class = "p" > ))< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-14-8" name = "__codelineno-14-8" href = "#__codelineno-14-8" > < / a > < span class = "w" > < / span > < span class = "k" > if< / span > < span class = "w" > < / span > < span class = "p" > (< / span > < span class = "nx" > visited< / span > < span class = "p" > .< / span > < span class = "nx" > has< / span > < span class = "p" > (< / span > < span class = "nx" > adjVet< / span > < span class = "p" > ))< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-14-9" name = "__codelineno-14-9" href = "#__codelineno-14-9" > < / a > < span class = "w" > < / span > < span class = "k" > continue< / span > < span class = "p" > ;< / span > < span class = "w" > < / span > < span class = "c1" > // 跳过已被访问过的顶点< / span >
< a id = "__codelineno-14-10" name = "__codelineno-14-10" href = "#__codelineno-14-10" > < / a > < span class = "w" > < / span > < span class = "p" > }< / span >
< a id = "__codelineno-14-11" name = "__codelineno-14-11" href = "#__codelineno-14-11" > < / a > < span class = "w" > < / span > < span class = "c1" > // 递归访问邻接顶点< / span >
< a id = "__codelineno-14-12" name = "__codelineno-14-12" href = "#__codelineno-14-12" > < / a > < span class = "w" > < / span > < span class = "nx" > dfs< / span > < span class = "p" > (< / span > < span class = "nx" > graph< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > visited< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > res< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > adjVet< / span > < span class = "p" > );< / span >
< a id = "__codelineno-14-13" name = "__codelineno-14-13" href = "#__codelineno-14-13" > < / a > < span class = "w" > < / span > < span class = "p" > }< / span >
< a id = "__codelineno-14-14" name = "__codelineno-14-14" href = "#__codelineno-14-14" > < / a > < span class = "p" > }< / span >
< a id = "__codelineno-14-15" name = "__codelineno-14-15" href = "#__codelineno-14-15" > < / a >
< a id = "__codelineno-14-16" name = "__codelineno-14-16" href = "#__codelineno-14-16" > < / a > < span class = "cm" > /* 深度优先遍历 DFS */< / span >
< a id = "__codelineno-14-17" name = "__codelineno-14-17" href = "#__codelineno-14-17" > < / a > < span class = "c1" > // 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点< / span >
< a id = "__codelineno-14-18" name = "__codelineno-14-18" href = "#__codelineno-14-18" > < / a > < span class = "kd" > function< / span > < span class = "w" > < / span > < span class = "nx" > graphDFS< / span > < span class = "p" > (< / span > < span class = "nx" > graph< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > startVet< / span > < span class = "p" > )< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-14-19" name = "__codelineno-14-19" href = "#__codelineno-14-19" > < / a > < span class = "w" > < / span > < span class = "c1" > // 顶点遍历序列< / span >
< a id = "__codelineno-14-20" name = "__codelineno-14-20" href = "#__codelineno-14-20" > < / a > < span class = "w" > < / span > < span class = "kd" > const< / span > < span class = "w" > < / span > < span class = "nx" > res< / span > < span class = "w" > < / span > < span class = "o" > =< / span > < span class = "w" > < / span > < span class = "p" > [];< / span >
< a id = "__codelineno-14-21" name = "__codelineno-14-21" href = "#__codelineno-14-21" > < / a > < span class = "w" > < / span > < span class = "c1" > // 哈希表，用于记录已被访问过的顶点< / span >
< a id = "__codelineno-14-22" name = "__codelineno-14-22" href = "#__codelineno-14-22" > < / a > < span class = "w" > < / span > < span class = "kd" > const< / span > < span class = "w" > < / span > < span class = "nx" > visited< / span > < span class = "w" > < / span > < span class = "o" > =< / span > < span class = "w" > < / span > < span class = "ow" > new< / span > < span class = "w" > < / span > < span class = "nb" > Set< / span > < span class = "p" > ();< / span >
< a id = "__codelineno-14-23" name = "__codelineno-14-23" href = "#__codelineno-14-23" > < / a > < span class = "w" > < / span > < span class = "nx" > dfs< / span > < span class = "p" > (< / span > < span class = "nx" > graph< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > visited< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > res< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > startVet< / span > < span class = "p" > );< / span >
< a id = "__codelineno-14-24" name = "__codelineno-14-24" href = "#__codelineno-14-24" > < / a > < span class = "w" > < / span > < span class = "k" > return< / span > < span class = "w" > < / span > < span class = "nx" > res< / span > < span class = "p" > ;< / span >
< a id = "__codelineno-14-25" name = "__codelineno-14-25" href = "#__codelineno-14-25" > < / a > < span class = "p" > }< / span >
< / code > < / pre > < / div >
< / div >
< div class = "tabbed-block" >
< div class = "highlight" > < span class = "filename" > graph_dfs.ts< / span > < pre > < span > < / span > < code > < a id = "__codelineno-15-1" name = "__codelineno-15-1" href = "#__codelineno-15-1" > < / a > < span class = "cm" > /* 深度优先遍历 DFS 辅助函数 */< / span >
< a id = "__codelineno-15-2" name = "__codelineno-15-2" href = "#__codelineno-15-2" > < / a > < span class = "kd" > function< / span > < span class = "w" > < / span > < span class = "nx" > dfs< / span > < span class = "p" > (< / span > < span class = "nx" > graph< / span > < span class = "o" > :< / span > < span class = "w" > < / span > < span class = "kt" > GraphAdjList< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > visited< / span > < span class = "o" > :< / span > < span class = "w" > < / span > < span class = "kt" > Set< / span > < span class = "o" > < < / span > < span class = "nx" > Vertex< / span > < span class = "o" > > < / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > res< / span > < span class = "o" > :< / span > < span class = "w" > < / span > < span class = "kt" > Vertex< / span > < span class = "p" > [],< / span > < span class = "w" > < / span > < span class = "nx" > vet< / span > < span class = "o" > :< / span > < span class = "w" > < / span > < span class = "kt" > Vertex< / span > < span class = "p" > )< / span > < span class = "o" > :< / span > < span class = "w" > < / span > < span class = "ow" > void< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-15-3" name = "__codelineno-15-3" href = "#__codelineno-15-3" > < / a > < span class = "w" > < / span > < span class = "nx" > res< / span > < span class = "p" > .< / span > < span class = "nx" > push< / span > < span class = "p" > (< / span > < span class = "nx" > vet< / span > < span class = "p" > );< / span > < span class = "w" > < / span > < span class = "c1" > // 记录访问顶点< / span >
< a id = "__codelineno-15-4" name = "__codelineno-15-4" href = "#__codelineno-15-4" > < / a > < span class = "w" > < / span > < span class = "nx" > visited< / span > < span class = "p" > .< / span > < span class = "nx" > add< / span > < span class = "p" > (< / span > < span class = "nx" > vet< / span > < span class = "p" > );< / span > < span class = "w" > < / span > < span class = "c1" > // 标记该顶点已被访问< / span >
< a id = "__codelineno-15-5" name = "__codelineno-15-5" href = "#__codelineno-15-5" > < / a > < span class = "w" > < / span > < span class = "c1" > // 遍历该顶点的所有邻接顶点< / span >
< a id = "__codelineno-15-6" name = "__codelineno-15-6" href = "#__codelineno-15-6" > < / a > < span class = "w" > < / span > < span class = "k" > for< / span > < span class = "w" > < / span > < span class = "p" > (< / span > < span class = "kd" > const< / span > < span class = "w" > < / span > < span class = "nx" > adjVet< / span > < span class = "w" > < / span > < span class = "k" > of< / span > < span class = "w" > < / span > < span class = "nx" > graph< / span > < span class = "p" > .< / span > < span class = "nx" > adjList< / span > < span class = "p" > .< / span > < span class = "nx" > get< / span > < span class = "p" > (< / span > < span class = "nx" > vet< / span > < span class = "p" > ))< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-15-7" name = "__codelineno-15-7" href = "#__codelineno-15-7" > < / a > < span class = "w" > < / span > < span class = "k" > if< / span > < span class = "w" > < / span > < span class = "p" > (< / span > < span class = "nx" > visited< / span > < span class = "p" > .< / span > < span class = "nx" > has< / span > < span class = "p" > (< / span > < span class = "nx" > adjVet< / span > < span class = "p" > ))< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-15-8" name = "__codelineno-15-8" href = "#__codelineno-15-8" > < / a > < span class = "w" > < / span > < span class = "k" > continue< / span > < span class = "p" > ;< / span > < span class = "w" > < / span > < span class = "c1" > // 跳过已被访问过的顶点< / span >
< a id = "__codelineno-15-9" name = "__codelineno-15-9" href = "#__codelineno-15-9" > < / a > < span class = "w" > < / span > < span class = "p" > }< / span >
< a id = "__codelineno-15-10" name = "__codelineno-15-10" href = "#__codelineno-15-10" > < / a > < span class = "w" > < / span > < span class = "c1" > // 递归访问邻接顶点< / span >
< a id = "__codelineno-15-11" name = "__codelineno-15-11" href = "#__codelineno-15-11" > < / a > < span class = "w" > < / span > < span class = "nx" > dfs< / span > < span class = "p" > (< / span > < span class = "nx" > graph< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > visited< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > res< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > adjVet< / span > < span class = "p" > );< / span >
< a id = "__codelineno-15-12" name = "__codelineno-15-12" href = "#__codelineno-15-12" > < / a > < span class = "w" > < / span > < span class = "p" > }< / span >
< a id = "__codelineno-15-13" name = "__codelineno-15-13" href = "#__codelineno-15-13" > < / a > < span class = "p" > }< / span >
< a id = "__codelineno-15-14" name = "__codelineno-15-14" href = "#__codelineno-15-14" > < / a >
< a id = "__codelineno-15-15" name = "__codelineno-15-15" href = "#__codelineno-15-15" > < / a > < span class = "cm" > /* 深度优先遍历 DFS */< / span >
< a id = "__codelineno-15-16" name = "__codelineno-15-16" href = "#__codelineno-15-16" > < / a > < span class = "c1" > // 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点< / span >
< a id = "__codelineno-15-17" name = "__codelineno-15-17" href = "#__codelineno-15-17" > < / a > < span class = "kd" > function< / span > < span class = "w" > < / span > < span class = "nx" > graphDFS< / span > < span class = "p" > (< / span > < span class = "nx" > graph< / span > < span class = "o" > :< / span > < span class = "w" > < / span > < span class = "kt" > GraphAdjList< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > startVet< / span > < span class = "o" > :< / span > < span class = "w" > < / span > < span class = "kt" > Vertex< / span > < span class = "p" > )< / span > < span class = "o" > :< / span > < span class = "w" > < / span > < span class = "nx" > Vertex< / span > < span class = "p" > []< / span > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-15-18" name = "__codelineno-15-18" href = "#__codelineno-15-18" > < / a > < span class = "w" > < / span > < span class = "c1" > // 顶点遍历序列< / span >
< a id = "__codelineno-15-19" name = "__codelineno-15-19" href = "#__codelineno-15-19" > < / a > < span class = "w" > < / span > < span class = "kd" > const< / span > < span class = "w" > < / span > < span class = "nx" > res< / span > < span class = "o" > :< / span > < span class = "w" > < / span > < span class = "kt" > Vertex< / span > < span class = "p" > []< / span > < span class = "w" > < / span > < span class = "o" > =< / span > < span class = "w" > < / span > < span class = "p" > [];< / span >
< a id = "__codelineno-15-20" name = "__codelineno-15-20" href = "#__codelineno-15-20" > < / a > < span class = "w" > < / span > < span class = "c1" > // 哈希表，用于记录已被访问过的顶点< / span >
< a id = "__codelineno-15-21" name = "__codelineno-15-21" href = "#__codelineno-15-21" > < / a > < span class = "w" > < / span > < span class = "kd" > const< / span > < span class = "w" > < / span > < span class = "nx" > visited< / span > < span class = "o" > :< / span > < span class = "w" > < / span > < span class = "kt" > Set< / span > < span class = "o" > < < / span > < span class = "nx" > Vertex< / span > < span class = "o" > > < / span > < span class = "w" > < / span > < span class = "o" > =< / span > < span class = "w" > < / span > < span class = "ow" > new< / span > < span class = "w" > < / span > < span class = "nb" > Set< / span > < span class = "p" > ();< / span >
< a id = "__codelineno-15-22" name = "__codelineno-15-22" href = "#__codelineno-15-22" > < / a > < span class = "w" > < / span > < span class = "nx" > dfs< / span > < span class = "p" > (< / span > < span class = "nx" > graph< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > visited< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > res< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "nx" > startVet< / span > < span class = "p" > );< / span >
< a id = "__codelineno-15-23" name = "__codelineno-15-23" href = "#__codelineno-15-23" > < / a > < span class = "w" > < / span > < span class = "k" > return< / span > < span class = "w" > < / span > < span class = "nx" > res< / span > < span class = "p" > ;< / span >
< a id = "__codelineno-15-24" name = "__codelineno-15-24" href = "#__codelineno-15-24" > < / a > < span class = "p" > }< / span >
< / code > < / pre > < / div >
< / div >
< div class = "tabbed-block" >
< div class = "highlight" > < span class = "filename" > graph_dfs.c< / span > < pre > < span > < / span > < code > < a id = "__codelineno-16-1" name = "__codelineno-16-1" href = "#__codelineno-16-1" > < / a > < span class = "p" > [< / span > < span class = "n" > class< / span > < span class = "p" > ]{}< / span > < span class = "o" > -< / span > < span class = "p" > [< / span > < span class = "n" > func< / span > < span class = "p" > ]{< / span > < span class = "n" > dfs< / span > < span class = "p" > }< / span >
< a id = "__codelineno-16-2" name = "__codelineno-16-2" href = "#__codelineno-16-2" > < / a >
< a id = "__codelineno-16-3" name = "__codelineno-16-3" href = "#__codelineno-16-3" > < / a > < span class = "p" > [< / span > < span class = "n" > class< / span > < span class = "p" > ]{}< / span > < span class = "o" > -< / span > < span class = "p" > [< / span > < span class = "n" > func< / span > < span class = "p" > ]{< / span > < span class = "n" > graphDFS< / span > < span class = "p" > }< / span >
< / code > < / pre > < / div >
< / div >
< div class = "tabbed-block" >
< div class = "highlight" > < span class = "filename" > graph_dfs.cs< / span > < pre > < span > < / span > < code > < a id = "__codelineno-17-1" name = "__codelineno-17-1" href = "#__codelineno-17-1" > < / a > < span class = "cm" > /* 深度优先遍历 DFS 辅助函数 */< / span >
< a id = "__codelineno-17-2" name = "__codelineno-17-2" href = "#__codelineno-17-2" > < / a > < span class = "k" > void< / span > < span class = "w" > < / span > < span class = "nf" > dfs< / span > < span class = "p" > (< / span > < span class = "n" > GraphAdjList< / span > < span class = "w" > < / span > < span class = "n" > graph< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > HashSet< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "o" > > < / span > < span class = "w" > < / span > < span class = "n" > visited< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > List< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "o" > > < / span > < span class = "w" > < / span > < span class = "n" > res< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > Vertex< / span > < span class = "w" > < / span > < span class = "n" > vet< / span > < span class = "p" > )< / span >
< a id = "__codelineno-17-3" name = "__codelineno-17-3" href = "#__codelineno-17-3" > < / a > < span class = "p" > {< / span >
< a id = "__codelineno-17-4" name = "__codelineno-17-4" href = "#__codelineno-17-4" > < / a > < span class = "w" > < / span > < span class = "n" > res< / span > < span class = "p" > .< / span > < span class = "n" > Add< / span > < span class = "p" > (< / span > < span class = "n" > vet< / span > < span class = "p" > );< / span > < span class = "w" > < / span > < span class = "c1" > // 记录访问顶点< / span >
< a id = "__codelineno-17-5" name = "__codelineno-17-5" href = "#__codelineno-17-5" > < / a > < span class = "w" > < / span > < span class = "n" > visited< / span > < span class = "p" > .< / span > < span class = "n" > Add< / span > < span class = "p" > (< / span > < span class = "n" > vet< / span > < span class = "p" > );< / span > < span class = "w" > < / span > < span class = "c1" > // 标记该顶点已被访问< / span >
< a id = "__codelineno-17-6" name = "__codelineno-17-6" href = "#__codelineno-17-6" > < / a > < span class = "w" > < / span > < span class = "c1" > // 遍历该顶点的所有邻接顶点< / span >
< a id = "__codelineno-17-7" name = "__codelineno-17-7" href = "#__codelineno-17-7" > < / a > < span class = "w" > < / span > < span class = "k" > foreach< / span > < span class = "w" > < / span > < span class = "p" > (< / span > < span class = "n" > Vertex< / span > < span class = "w" > < / span > < span class = "n" > adjVet< / span > < span class = "w" > < / span > < span class = "k" > in< / span > < span class = "w" > < / span > < span class = "n" > graph< / span > < span class = "p" > .< / span > < span class = "n" > adjList< / span > < span class = "p" > [< / span > < span class = "n" > vet< / span > < span class = "p" > ])< / span >
< a id = "__codelineno-17-8" name = "__codelineno-17-8" href = "#__codelineno-17-8" > < / a > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-17-9" name = "__codelineno-17-9" href = "#__codelineno-17-9" > < / a > < span class = "w" > < / span > < span class = "k" > if< / span > < span class = "w" > < / span > < span class = "p" > (< / span > < span class = "n" > visited< / span > < span class = "p" > .< / span > < span class = "n" > Contains< / span > < span class = "p" > (< / span > < span class = "n" > adjVet< / span > < span class = "p" > ))< / span >
< a id = "__codelineno-17-10" name = "__codelineno-17-10" href = "#__codelineno-17-10" > < / a > < span class = "w" > < / span > < span class = "p" > {< / span >
< a id = "__codelineno-17-11" name = "__codelineno-17-11" href = "#__codelineno-17-11" > < / a > < span class = "w" > < / span > < span class = "k" > continue< / span > < span class = "p" > ;< / span > < span class = "w" > < / span > < span class = "c1" > // 跳过已被访问过的顶点 < / span >
< a id = "__codelineno-17-12" name = "__codelineno-17-12" href = "#__codelineno-17-12" > < / a > < span class = "w" > < / span > < span class = "p" > }< / span >
< a id = "__codelineno-17-13" name = "__codelineno-17-13" href = "#__codelineno-17-13" > < / a > < span class = "w" > < / span > < span class = "c1" > // 递归访问邻接顶点< / span >
< a id = "__codelineno-17-14" name = "__codelineno-17-14" href = "#__codelineno-17-14" > < / a > < span class = "w" > < / span > < span class = "n" > dfs< / span > < span class = "p" > (< / span > < span class = "n" > graph< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > visited< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > res< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > adjVet< / span > < span class = "p" > );< / span >
< a id = "__codelineno-17-15" name = "__codelineno-17-15" href = "#__codelineno-17-15" > < / a > < span class = "w" > < / span > < span class = "p" > }< / span >
< a id = "__codelineno-17-16" name = "__codelineno-17-16" href = "#__codelineno-17-16" > < / a > < span class = "p" > }< / span >
< a id = "__codelineno-17-17" name = "__codelineno-17-17" href = "#__codelineno-17-17" > < / a >
< a id = "__codelineno-17-18" name = "__codelineno-17-18" href = "#__codelineno-17-18" > < / a > < span class = "cm" > /* 深度优先遍历 DFS */< / span >
< a id = "__codelineno-17-19" name = "__codelineno-17-19" href = "#__codelineno-17-19" > < / a > < span class = "c1" > // 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点< / span >
< a id = "__codelineno-17-20" name = "__codelineno-17-20" href = "#__codelineno-17-20" > < / a > < span class = "n" > List< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "o" > > < / span > < span class = "w" > < / span > < span class = "n" > graphDFS< / span > < span class = "p" > (< / span > < span class = "n" > GraphAdjList< / span > < span class = "w" > < / span > < span class = "n" > graph< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > Vertex< / span > < span class = "w" > < / span > < span class = "n" > startVet< / span > < span class = "p" > )< / span >
< a id = "__codelineno-17-21" name = "__codelineno-17-21" href = "#__codelineno-17-21" > < / a > < span class = "p" > {< / span >
< a id = "__codelineno-17-22" name = "__codelineno-17-22" href = "#__codelineno-17-22" > < / a > < span class = "w" > < / span > < span class = "c1" > // 顶点遍历序列< / span >
< a id = "__codelineno-17-23" name = "__codelineno-17-23" href = "#__codelineno-17-23" > < / a > < span class = "w" > < / span > < span class = "n" > List< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "o" > > < / span > < span class = "w" > < / span > < span class = "n" > res< / span > < span class = "w" > < / span > < span class = "o" > =< / span > < span class = "w" > < / span > < span class = "k" > new< / span > < span class = "w" > < / span > < span class = "n" > List< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "o" > > < / span > < span class = "p" > ();< / span >
< a id = "__codelineno-17-24" name = "__codelineno-17-24" href = "#__codelineno-17-24" > < / a > < span class = "w" > < / span > < span class = "c1" > // 哈希表，用于记录已被访问过的顶点< / span >
< a id = "__codelineno-17-25" name = "__codelineno-17-25" href = "#__codelineno-17-25" > < / a > < span class = "w" > < / span > < span class = "n" > HashSet< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "o" > > < / span > < span class = "w" > < / span > < span class = "n" > visited< / span > < span class = "w" > < / span > < span class = "o" > =< / span > < span class = "w" > < / span > < span class = "k" > new< / span > < span class = "w" > < / span > < span class = "n" > HashSet< / span > < span class = "o" > < < / span > < span class = "n" > Vertex< / span > < span class = "o" > > < / span > < span class = "p" > ();< / span >
< a id = "__codelineno-17-26" name = "__codelineno-17-26" href = "#__codelineno-17-26" > < / a > < span class = "w" > < / span > < span class = "n" > dfs< / span > < span class = "p" > (< / span > < span class = "n" > graph< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > visited< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > res< / span > < span class = "p" > ,< / span > < span class = "w" > < / span > < span class = "n" > startVet< / span > < span class = "p" > );< / span >
< a id = "__codelineno-17-27" name = "__codelineno-17-27" href = "#__codelineno-17-27" > < / a > < span class = "w" > < / span > < span class = "k" > return< / span > < span class = "w" > < / span > < span class = "n" > res< / span > < span class = "p" > ;< / span >
< a id = "__codelineno-17-28" name = "__codelineno-17-28" href = "#__codelineno-17-28" > < / a > < span class = "p" > }< / span >
< / code > < / pre > < / div >
< / div >
< div class = "tabbed-block" >
< div class = "highlight" > < span class = "filename" > graph_dfs.swift< / span > < pre > < span > < / span > < code > < a id = "__codelineno-18-1" name = "__codelineno-18-1" href = "#__codelineno-18-1" > < / a > < span class = "cm" > /* 深度优先遍历 DFS 辅助函数 */< / span >
< a id = "__codelineno-18-2" name = "__codelineno-18-2" href = "#__codelineno-18-2" > < / a > < span class = "kd" > func< / span > < span class = "nf" > dfs< / span > < span class = "p" > (< / span > < span class = "n" > graph< / span > < span class = "p" > :< / span > < span class = "n" > GraphAdjList< / span > < span class = "p" > ,< / span > < span class = "n" > visited< / span > < span class = "p" > :< / span > < span class = "kr" > inout< / span > < span class = "n" > Set< / span > < span class = "p" > < < / span > < span class = "n" > Vertex< / span > < span class = "p" > > ,< / span > < span class = "n" > res< / span > < span class = "p" > :< / span > < span class = "kr" > inout< / span > < span class = "p" > [< / span > < span class = "n" > Vertex< / span > < span class = "p" > ],< / span > < span class = "n" > vet< / span > < span class = "p" > :< / span > < span class = "n" > Vertex< / span > < span class = "p" > )< / span > < span class = "p" > {< / span >
< a id = "__codelineno-18-3" name = "__codelineno-18-3" href = "#__codelineno-18-3" > < / a > < span class = "n" > res< / span > < span class = "p" > .< / span > < span class = "n" > append< / span > < span class = "p" > (< / span > < span class = "n" > vet< / span > < span class = "p" > )< / span > < span class = "c1" > // 记录访问顶点< / span >
< a id = "__codelineno-18-4" name = "__codelineno-18-4" href = "#__codelineno-18-4" > < / a > < span class = "n" > visited< / span > < span class = "p" > .< / span > < span class = "bp" > insert< / span > < span class = "p" > (< / span > < span class = "n" > vet< / span > < span class = "p" > )< / span > < span class = "c1" > // 标记该顶点已被访问< / span >
< a id = "__codelineno-18-5" name = "__codelineno-18-5" href = "#__codelineno-18-5" > < / a > < span class = "c1" > // 遍历该顶点的所有邻接顶点< / span >
< a id = "__codelineno-18-6" name = "__codelineno-18-6" href = "#__codelineno-18-6" > < / a > < span class = "k" > for< / span > < span class = "n" > adjVet< / span > < span class = "k" > in< / span > < span class = "n" > graph< / span > < span class = "p" > .< / span > < span class = "n" > adjList< / span > < span class = "p" > [< / span > < span class = "n" > vet< / span > < span class = "p" > ]< / span > < span class = "p" > ??< / span > < span class = "p" > []< / span > < span class = "p" > {< / span >
< a id = "__codelineno-18-7" name = "__codelineno-18-7" href = "#__codelineno-18-7" > < / a > < span class = "k" > if< / span > < span class = "n" > visited< / span > < span class = "p" > .< / span > < span class = "bp" > contains< / span > < span class = "p" > (< / span > < span class = "n" > adjVet< / span > < span class = "p" > )< / span > < span class = "p" > {< / span >
< a id = "__codelineno-18-8" name = "__codelineno-18-8" href = "#__codelineno-18-8" > < / a > < span class = "k" > continue< / span > < span class = "c1" > // 跳过已被访问过的顶点< / span >
< a id = "__codelineno-18-9" name = "__codelineno-18-9" href = "#__codelineno-18-9" > < / a > < span class = "p" > }< / span >
< a id = "__codelineno-18-10" name = "__codelineno-18-10" href = "#__codelineno-18-10" > < / a > < span class = "c1" > // 递归访问邻接顶点< / span >
< a id = "__codelineno-18-11" name = "__codelineno-18-11" href = "#__codelineno-18-11" > < / a > < span class = "n" > dfs< / span > < span class = "p" > (< / span > < span class = "n" > graph< / span > < span class = "p" > :< / span > < span class = "n" > graph< / span > < span class = "p" > ,< / span > < span class = "n" > visited< / span > < span class = "p" > :< / span > < span class = "p" > & < / span > < span class = "n" > visited< / span > < span class = "p" > ,< / span > < span class = "n" > res< / span > < span class = "p" > :< / span > < span class = "p" > & < / span > < span class = "n" > res< / span > < span class = "p" > ,< / span > < span class = "n" > vet< / span > < span class = "p" > :< / span > < span class = "n" > adjVet< / span > < span class = "p" > )< / span >
< a id = "__codelineno-18-12" name = "__codelineno-18-12" href = "#__codelineno-18-12" > < / a > < span class = "p" > }< / span >
< a id = "__codelineno-18-13" name = "__codelineno-18-13" href = "#__codelineno-18-13" > < / a > < span class = "p" > }< / span >
< a id = "__codelineno-18-14" name = "__codelineno-18-14" href = "#__codelineno-18-14" > < / a >
< a id = "__codelineno-18-15" name = "__codelineno-18-15" href = "#__codelineno-18-15" > < / a > < span class = "cm" > /* 深度优先遍历 DFS */< / span >
< a id = "__codelineno-18-16" name = "__codelineno-18-16" href = "#__codelineno-18-16" > < / a > < span class = "c1" > // 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点< / span >
< a id = "__codelineno-18-17" name = "__codelineno-18-17" href = "#__codelineno-18-17" > < / a > < span class = "kd" > func< / span > < span class = "nf" > graphDFS< / span > < span class = "p" > (< / span > < span class = "n" > graph< / span > < span class = "p" > :< / span > < span class = "n" > GraphAdjList< / span > < span class = "p" > ,< / span > < span class = "n" > startVet< / span > < span class = "p" > :< / span > < span class = "n" > Vertex< / span > < span class = "p" > )< / span > < span class = "p" > -> < / span > < span class = "p" > [< / span > < span class = "n" > Vertex< / span > < span class = "p" > ]< / span > < span class = "p" > {< / span >
< a id = "__codelineno-18-18" name = "__codelineno-18-18" href = "#__codelineno-18-18" > < / a > < span class = "c1" > // 顶点遍历序列< / span >
< a id = "__codelineno-18-19" name = "__codelineno-18-19" href = "#__codelineno-18-19" > < / a > < span class = "kd" > var< / span > < span class = "nv" > res< / span > < span class = "p" > :< / span > < span class = "p" > [< / span > < span class = "n" > Vertex< / span > < span class = "p" > ]< / span > < span class = "p" > =< / span > < span class = "p" > []< / span >
< a id = "__codelineno-18-20" name = "__codelineno-18-20" href = "#__codelineno-18-20" > < / a > < span class = "c1" > // 哈希表，用于记录已被访问过的顶点< / span >
< a id = "__codelineno-18-21" name = "__codelineno-18-21" href = "#__codelineno-18-21" > < / a > < span class = "kd" > var< / span > < span class = "nv" > visited< / span > < span class = "p" > :< / span > < span class = "n" > Set< / span > < span class = "p" > < < / span > < span class = "n" > Vertex< / span > < span class = "p" > > < / span > < span class = "p" > =< / span > < span class = "p" > []< / span >
< a id = "__codelineno-18-22" name = "__codelineno-18-22" href = "#__codelineno-18-22" > < / a > < span class = "n" > dfs< / span > < span class = "p" > (< / span > < span class = "n" > graph< / span > < span class = "p" > :< / span > < span class = "n" > graph< / span > < span class = "p" > ,< / span > < span class = "n" > visited< / span > < span class = "p" > :< / span > < span class = "p" > & < / span > < span class = "n" > visited< / span > < span class = "p" > ,< / span > < span class = "n" > res< / span > < span class = "p" > :< / span > < span class = "p" > & < / span > < span class = "n" > res< / span > < span class = "p" > ,< / span > < span class = "n" > vet< / span > < span class = "p" > :< / span > < span class = "n" > startVet< / span > < span class = "p" > )< / span >
< a id = "__codelineno-18-23" name = "__codelineno-18-23" href = "#__codelineno-18-23" > < / a > < span class = "k" > return< / span > < span class = "n" > res< / span >
< a id = "__codelineno-18-24" name = "__codelineno-18-24" href = "#__codelineno-18-24" > < / a > < span class = "p" > }< / span >
< / code > < / pre > < / div >
< / div >
< div class = "tabbed-block" >
< div class = "highlight" > < span class = "filename" > graph_dfs.zig< / span > < pre > < span > < / span > < code > < a id = "__codelineno-19-1" name = "__codelineno-19-1" href = "#__codelineno-19-1" > < / a > < span class = "p" > [< / span > < span class = "n" > class< / span > < span class = "p" > ]{}< / span > < span class = "o" > -< / span > < span class = "p" > [< / span > < span class = "n" > func< / span > < span class = "p" > ]{< / span > < span class = "n" > dfs< / span > < span class = "p" > }< / span >
< a id = "__codelineno-19-2" name = "__codelineno-19-2" href = "#__codelineno-19-2" > < / a >
< a id = "__codelineno-19-3" name = "__codelineno-19-3" href = "#__codelineno-19-3" > < / a > < span class = "p" > [< / span > < span class = "n" > class< / span > < span class = "p" > ]{}< / span > < span class = "o" > -< / span > < span class = "p" > [< / span > < span class = "n" > func< / span > < span class = "p" > ]{< / span > < span class = "n" > graphDFS< / span > < span class = "p" > }< / span >
< / code > < / pre > < / div >
< / div >
< / div >
< / div >
< p > 深度优先遍历的算法流程如下图所示，其中：< / p >
< ul >
< li > < strong > 直虚线代表向下递推< / strong > ，表示开启了一个新的递归方法来访问新顶点；< / li >
< li > < strong > 曲虚线代表向上回溯< / strong > ，表示此递归方法已经返回，回溯到了开启此递归方法的位置；< / li >
< / ul >
< p > 为了加深理解，建议将图示与代码结合起来，在脑中（或者用笔画下来）模拟整个 DFS 过程，包括每个递归方法何时开启、何时返回。< / p >
< div class = "tabbed-set tabbed-alternate" data-tabs = "4:11" > < input checked = "checked" id = "__tabbed_4_1" name = "__tabbed_4" type = "radio" / > < input id = "__tabbed_4_2" name = "__tabbed_4" type = "radio" / > < input id = "__tabbed_4_3" name = "__tabbed_4" type = "radio" / > < input id = "__tabbed_4_4" name = "__tabbed_4" type = "radio" / > < input id = "__tabbed_4_5" name = "__tabbed_4" type = "radio" / > < input id = "__tabbed_4_6" name = "__tabbed_4" type = "radio" / > < input id = "__tabbed_4_7" name = "__tabbed_4" type = "radio" / > < input id = "__tabbed_4_8" name = "__tabbed_4" type = "radio" / > < input id = "__tabbed_4_9" name = "__tabbed_4" type = "radio" / > < input id = "__tabbed_4_10" name = "__tabbed_4" type = "radio" / > < input id = "__tabbed_4_11" name = "__tabbed_4" type = "radio" / > < div class = "tabbed-labels" > < label for = "__tabbed_4_1" > < 1> < / label > < label for = "__tabbed_4_2" > < 2> < / label > < label for = "__tabbed_4_3" > < 3> < / label > < label for = "__tabbed_4_4" > < 4> < / label > < label for = "__tabbed_4_5" > < 5> < / label > < label for = "__tabbed_4_6" > < 6> < / label > < label for = "__tabbed_4_7" > < 7> < / label > < label for = "__tabbed_4_8" > < 8> < / label > < label for = "__tabbed_4_9" > < 9> < / label > < label for = "__tabbed_4_10" > < 10> < / label > < label for = "__tabbed_4_11" > < 11> < / label > < / div >
< div class = "tabbed-content" >
< div class = "tabbed-block" >
< p > < img alt = "图的深度优先遍历步骤" src = "../graph_traversal.assets/graph_dfs_step1.png" / > < / p >
< / div >
< div class = "tabbed-block" >
< p > < img alt = "graph_dfs_step2" src = "../graph_traversal.assets/graph_dfs_step2.png" / > < / p >
< / div >
< div class = "tabbed-block" >
< p > < img alt = "graph_dfs_step3" src = "../graph_traversal.assets/graph_dfs_step3.png" / > < / p >
< / div >
< div class = "tabbed-block" >
< p > < img alt = "graph_dfs_step4" src = "../graph_traversal.assets/graph_dfs_step4.png" / > < / p >
< / div >
< div class = "tabbed-block" >
< p > < img alt = "graph_dfs_step5" src = "../graph_traversal.assets/graph_dfs_step5.png" / > < / p >
< / div >
< div class = "tabbed-block" >
< p > < img alt = "graph_dfs_step6" src = "../graph_traversal.assets/graph_dfs_step6.png" / > < / p >
< / div >
< div class = "tabbed-block" >
< p > < img alt = "graph_dfs_step7" src = "../graph_traversal.assets/graph_dfs_step7.png" / > < / p >
< / div >
< div class = "tabbed-block" >
< p > < img alt = "graph_dfs_step8" src = "../graph_traversal.assets/graph_dfs_step8.png" / > < / p >
< / div >
< div class = "tabbed-block" >
< p > < img alt = "graph_dfs_step9" src = "../graph_traversal.assets/graph_dfs_step9.png" / > < / p >
< / div >
< div class = "tabbed-block" >
< p > < img alt = "graph_dfs_step10" src = "../graph_traversal.assets/graph_dfs_step10.png" / > < / p >
< / div >
< div class = "tabbed-block" >
< p > < img alt = "graph_dfs_step11" src = "../graph_traversal.assets/graph_dfs_step11.png" / > < / p >
< / div >
< / div >
< / div >
< div class = "admonition question" >
< p class = "admonition-title" > 深度优先遍历的序列是否唯一？< / p >
< p > 与广度优先遍历类似，深度优先遍历序列的顺序也不是唯一的。给定某顶点，先往哪个方向探索都可以，即邻接顶点的顺序可以任意打乱，都是深度优先遍历。< / p >
< p > 以树的遍历为例，“根 < span class = "arithmatex" > \(\rightarrow\)< / span > 左 < span class = "arithmatex" > \(\rightarrow\)< / span > 右”、“左 < span class = "arithmatex" > \(\rightarrow\)< / span > 根 < span class = "arithmatex" > \(\rightarrow\)< / span > 右”、“左 < span class = "arithmatex" > \(\rightarrow\)< / span > 右 < span class = "arithmatex" > \(\rightarrow\)< / span > 根”分别对应前序、中序、后序遍历，它们展示了三种不同的遍历优先级，然而这三者都属于深度优先遍历。< / p >
< / div >
< h3 id = "_4" > 复杂度分析< a class = "headerlink" href = "#_4" title = "Permanent link" > ¶ < / a > < / h3 >
< p > < strong > 时间复杂度：< / strong > 所有顶点都会被访问 < span class = "arithmatex" > \(1\)< / span > 次，使用 < span class = "arithmatex" > \(O(|V|)\)< / span > 时间；所有边都会被访问 < span class = "arithmatex" > \(2\)< / span > 次，使用 < span class = "arithmatex" > \(O(2|E|)\)< / span > 时间；总体使用 < span class = "arithmatex" > \(O(|V| + |E|)\)< / span > 时间。< / p >
< p > < strong > 空间复杂度：< / strong > 列表 < code > res< / code > ，哈希表 < code > visited< / code > 顶点数量最多为 < span class = "arithmatex" > \(|V|\)< / span > ，递归深度最大为 < span class = "arithmatex" > \(|V|\)< / span > ，因此使用 < span class = "arithmatex" > \(O(|V|)\)< / span > 空间。< / p >
< h2 id = "__comments" > 评论< / h2 >
<!-- Insert generated snippet here -->
< script
src="https://giscus.app/client.js"
data-repo="krahets/hello-algo"
data-repo-id="R_kgDOIXtSqw"
data-category="Announcements"
data-category-id="DIC_kwDOIXtSq84CSZk_"
data-mapping="pathname"
data-strict="1"
data-reactions-enabled="1"
data-emit-metadata="0"
data-input-position="bottom"
data-theme="preferred_color_scheme"
data-lang="zh-CN"
crossorigin="anonymous"
async
>
< / script >
<!-- Synchronize Giscus theme with palette -->
< script >
var giscus = document.querySelector("script[src*=giscus]")
/* Set palette on initial load */
var palette = __md_get("__palette")
if (palette & & typeof palette.color === "object") {
var theme = palette.color.scheme === "slate" ? "dark" : "light"
giscus.setAttribute("data-theme", theme)
}
/* Register event handlers after documented loaded */
document.addEventListener("DOMContentLoaded", function() {
var ref = document.querySelector("[data-md-component=palette]")
ref.addEventListener("change", function() {
var palette = __md_get("__palette")
if (palette & & typeof palette.color === "object") {
var theme = palette.color.scheme === "slate" ? "dark" : "light"
/* Instruct Giscus to change theme */
var frame = document.querySelector(".giscus-frame")
frame.contentWindow.postMessage(
{ giscus: { setConfig: { theme } } },
"https://giscus.app"
)
}
})
})
< / script >
< / article >
< / div >
< script > var tabs = _ _md _get ( "__tabs" ) ; if ( Array . isArray ( tabs ) ) e : for ( var set of document . querySelectorAll ( ".tabbed-set" ) ) { var tab , labels = set . querySelector ( ".tabbed-labels" ) ; for ( tab of tabs ) for ( var label of labels . getElementsByTagName ( "label" ) ) if ( label . innerText . trim ( ) === tab ) { var input = document . getElementById ( label . htmlFor ) ; input . checked = ! 0 ; continue e } } < / script >
< / div >
< button type = "button" class = "md-top md-icon" data-md-component = "top" hidden >
< svg xmlns = "http://www.w3.org/2000/svg" viewBox = "0 0 24 24" > < path d = "M13 20h-2V8l-5.5 5.5-1.42-1.42L12 4.16l7.92 7.92-1.42 1.42L13 8v12Z" / > < / svg >
回到页面顶部
< / button >
< / main >
< footer class = "md-footer" >
< nav class = "md-footer__inner md-grid" aria-label = "页脚" >
< a href = "../graph_operations/" class = "md-footer__link md-footer__link--prev" aria-label = "上一页: 10.2. &nbsp; 图基础操作" rel = "prev" >
< div class = "md-footer__button md-icon" >
< svg xmlns = "http://www.w3.org/2000/svg" viewBox = "0 0 24 24" > < path d = "M20 11v2H8l5.5 5.5-1.42 1.42L4.16 12l7.92-7.92L13.5 5.5 8 11h12Z" / > < / svg >
< / div >
< div class = "md-footer__title" >
< span class = "md-footer__direction" >
上一页
< / span >
< div class = "md-ellipsis" >
10.2. 图基础操作
< / div >
< / div >
< / a >
< a href = "../summary/" class = "md-footer__link md-footer__link--next" aria-label = "下一页: 10.4. &nbsp; 小结" rel = "next" >
< div class = "md-footer__title" >
< span class = "md-footer__direction" >
下一页
< / span >
< div class = "md-ellipsis" >
10.4. 小结
< / div >
< / div >
< div class = "md-footer__button md-icon" >
< svg xmlns = "http://www.w3.org/2000/svg" viewBox = "0 0 24 24" > < path d = "M4 11v2h12l-5.5 5.5 1.42 1.42L19.84 12l-7.92-7.92L10.5 5.5 16 11H4Z" / > < / svg >
< / div >
< / a >
< / nav >
< div class = "md-footer-meta md-typeset" >
< div class = "md-footer-meta__inner md-grid" >
< div class = "md-copyright" >
< div class = "md-copyright__highlight" >
Copyright © 2023 Krahets
< / div >
< / div >
< div class = "md-social" >
< a href = "https://github.com/krahets" target = "_blank" rel = "noopener" title = "github.com" class = "md-social__link" >
< svg xmlns = "http://www.w3.org/2000/svg" viewBox = "0 0 496 512" > <!-- ! Font Awesome Free 6.4.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2023 Fonticons, Inc. --> < path d = "M165.9 397.4c0 2-2.3 3.6-5.2 3.6-3.3.3-5.6-1.3-5.6-3.6 0-2 2.3-3.6 5.2-3.6 3-.3 5.6 1.3 5.6 3.6zm-31.1-4.5c-.7 2 1.3 4.3 4.3 4.9 2.6 1 5.6 0 6.2-2s-1.3-4.3-4.3-5.2c-2.6-.7-5.5.3-6.2 2.3zm44.2-1.7c-2.9.7-4.9 2.6-4.6 4.9.3 2 2.9 3.3 5.9 2.6 2.9-.7 4.9-2.6 4.6-4.6-.3-1.9-3-3.2-5.9-2.9zM244.8 8C106.1 8 0 113.3 0 252c0 110.9 69.8 205.8 169.5 239.2 12.8 2.3 17.3-5.6 17.3-12.1 0-6.2-.3-40.4-.3-61.4 0 0-70 15-84.7-29.8 0 0-11.4-29.1-27.8-36.6 0 0-22.9-15.7 1.6-15.4 0 0 24.9 2 38.6 25.8 21.9 38.6 58.6 27.5 72.9 20.9 2.3-16 8.8-27.1 16-33.7-55.9-6.2-112.3-14.3-112.3-110.5 0-27.5 7.6-41.3 23.6-58.9-2.6-6.5-11.1-33.3 2.6-67.9 20.9-6.5 69 27 69 27 20-5.6 41.5-8.5 62.8-8.5s42.8 2.9 62.8 8.5c0 0 48.1-33.6 69-27 13.7 34.7 5.2 61.4 2.6 67.9 16 17.7 25.8 31.5 25.8 58.9 0 96.5-58.9 104.2-114.8 110.5 9.2 7.9 17 22.9 17 46.4 0 33.7-.3 75.4-.3 83.6 0 6.5 4.6 14.4 17.3 12.1C428.2 457.8 496 362.9 496 252 496 113.3 383.5 8 244.8 8zM97.2 352.9c-1.3 1-1 3.3.7 5.2 1.6 1.6 3.9 2.3 5.2 1 1.3-1 1-3.3-.7-5.2-1.6-1.6-3.9-2.3-5.2-1zm-10.8-8.1c-.7 1.3.3 2.9 2.3 3.9 1.6 1 3.6.7 4.3-.7.7-1.3-.3-2.9-2.3-3.9-2-.6-3.6-.3-4.3.7zm32.4 35.6c-1.6 1.3-1 4.3 1.3 6.2 2.3 2.3 5.2 2.6 6.5 1 1.3-1.3.7-4.3-1.3-6.2-2.2-2.3-5.2-2.6-6.5-1zm-11.4-14.7c-1.6 1-1.6 3.6 0 5.9 1.6 2.3 4.3 3.3 5.6 2.3 1.6-1.3 1.6-3.9 0-6.2-1.4-2.3-4-3.3-5.6-2z" / > < / svg >
< / a >
< a href = "https://twitter.com/krahets" target = "_blank" rel = "noopener" title = "twitter.com" class = "md-social__link" >
< svg xmlns = "http://www.w3.org/2000/svg" viewBox = "0 0 512 512" > <!-- ! Font Awesome Free 6.4.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2023 Fonticons, Inc. --> < path d = "M459.37 151.716c.325 4.548.325 9.097.325 13.645 0 138.72-105.583 298.558-298.558 298.558-59.452 0-114.68-17.219-161.137-47.106 8.447.974 16.568 1.299 25.34 1.299 49.055 0 94.213-16.568 130.274-44.832-46.132-.975-84.792-31.188-98.112-72.772 6.498.974 12.995 1.624 19.818 1.624 9.421 0 18.843-1.3 27.614-3.573-48.081-9.747-84.143-51.98-84.143-102.985v-1.299c13.969 7.797 30.214 12.67 47.431 13.319-28.264-18.843-46.781-51.005-46.781-87.391 0-19.492 5.197-37.36 14.294-52.954 51.655 63.675 129.3 105.258 216.365 109.807-1.624-7.797-2.599-15.918-2.599-24.04 0-57.828 46.782-104.934 104.934-104.934 30.213 0 57.502 12.67 76.67 33.137 23.715-4.548 46.456-13.32 66.599-25.34-7.798 24.366-24.366 44.833-46.132 57.827 21.117-2.273 41.584-8.122 60.426-16.243-14.292 20.791-32.161 39.308-52.628 54.253z" / > < / svg >
< / a >
< a href = "https://leetcode.cn/u/jyd/" target = "_blank" rel = "noopener" title = "leetcode.cn" class = "md-social__link" >
< svg xmlns = "http://www.w3.org/2000/svg" viewBox = "0 0 640 512" > <!-- ! Font Awesome Free 6.4.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2023 Fonticons, Inc. --> < path d = "M392.8 1.2c-17-4.9-34.7 5-39.6 22l-128 448c-4.9 17 5 34.7 22 39.6s34.7-5 39.6-22l128-448c4.9-17-5-34.7-22-39.6zm80.6 120.1c-12.5 12.5-12.5 32.8 0 45.3l89.3 89.4-89.4 89.4c-12.5 12.5-12.5 32.8 0 45.3s32.8 12.5 45.3 0l112-112c12.5-12.5 12.5-32.8 0-45.3l-112-112c-12.5-12.5-32.8-12.5-45.3 0zm-306.7 0c-12.5-12.5-32.8-12.5-45.3 0l-112 112c-12.5 12.5-12.5 32.8 0 45.3l112 112c12.5 12.5 32.8 12.5 45.3 0s12.5-32.8 0-45.3L77.3 256l89.4-89.4c12.5-12.5 12.5-32.8 0-45.3z" / > < / svg >
< / a >
< / div >
< / div >
< / div >
< / footer >
< / div >
< div class = "md-dialog" data-md-component = "dialog" >
< div class = "md-dialog__inner md-typeset" > < / div >
< / div >
< script id = "__config" type = "application/json" > { "base" : "../.." , "features" : [ "content.action.edit" , "content.code.annotate" , "content.code.copy" , "content.tabs.link" , "content.tooltips" , "navigation.indexes" , "navigation.sections" , "navigation.top" , "navigation.footer" , "navigation.tracking" , "search.highlight" , "search.share" , "search.suggest" , "toc.follow" ] , "search" : "../../assets/javascripts/workers/search.208ed371.min.js" , "translations" : { "clipboard.copied" : "\u5df2\u590d\u5236" , "clipboard.copy" : "\u590d\u5236" , "search.result.more.one" : "\u5728\u8be5\u9875\u4e0a\u8fd8\u6709 1 \u4e2a\u7b26\u5408\u6761\u4ef6\u7684\u7ed3\u679c" , "search.result.more.other" : "\u5728\u8be5\u9875\u4e0a\u8fd8\u6709 # \u4e2a\u7b26\u5408\u6761\u4ef6\u7684\u7ed3\u679c" , "search.result.none" : "\u6ca1\u6709\u627e\u5230\u7b26\u5408\u6761\u4ef6\u7684\u7ed3\u679c" , "search.result.one" : "\u627e\u5230 1 \u4e2a\u7b26\u5408\u6761\u4ef6\u7684\u7ed3\u679c" , "search.result.other" : "# \u4e2a\u7b26\u5408\u6761\u4ef6\u7684\u7ed3\u679c" , "search.result.placeholder" : "\u952e\u5165\u4ee5\u5f00\u59cb\u641c\u7d22" , "search.result.term.missing" : "\u7f3a\u5c11" , "select.version" : "\u9009\u62e9\u5f53\u524d\u7248\u672c" } } < / script >
< script src = "../../assets/javascripts/bundle.51198bba.min.js" > < / script >
< script src = "../../javascripts/mathjax.js" > < / script >
< script src = "https://polyfill.io/v3/polyfill.min.js?features=es6" > < / script >
< script src = "https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js" > < / script >
< / body >
< / html >
