最çŸçµŒè·¯å•é¡Œç·ç‰¹é›†ï¼ï¼ï¼ï½žBFSã‹ã‚‰æ‹¡å¼µãƒ€ã‚¤ã‚¯ã‚¹ãƒˆãƒ©ã¾ã§ï½ž - QiitaDeleted articles cannot be recovered. Draft of this article would be also deleted. Are you sure you want to delete this article? 基本的アルゴリズム（幅優先探索ãªã©ï¼‰ã‹ã‚‰å¿œç”¨ï¼ˆçµŒè·¯å¾©å…ƒã€æ‹¡å¼µãƒ€ã‚¤ã‚¯ã‚¹ãƒˆãƒ©ãªã©ï¼‰ã¾ã§ã€æœ€çŸçµŒè·¯å•é¡Œã«é–¢ã™ã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’ç·ç‰¹é›†ã—ã¾ã—ãŸã€‚ 基本的ãªã‚°ãƒ©ãƒ•ç†è«–ã®ç”¨èªžã«ã¤ã„ã¦ã¯ã€æ¬¡ã‚’å‚考ã«ã—ã¦ãã ã•ã„。 グラフç†è«–　用語集 queueãªã©ã®ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã®ç”¨èªžã«ã¤ã„ã¦ã¯ã€æ¬¡ã®ã‚¹ãƒ©ã‚¤ãƒ‰ã®å¾ŒåŠã‚’å‚考ã«ã—ã¦ãã ã•ã„。 C++ STL講習会 by @e869120 最çŸçµŒè·¯å•é¡Œã¨ã¯ 一般的ã«ã€æ¬¡ã®ã‚ˆã†ãªå•é¡Œã¨ã•ã‚Œã¾ã™ã€‚ $V$ é ‚ç‚¹ã¨ $E$ 辺ã‹ã‚‰ãªã‚‹ã‚°ãƒ©ãƒ•ãŒä¸Žãˆã‚‰ã‚Œã‚‹ã€‚é ‚ç‚¹ $u$ ã¨ é ‚ç‚¹ $v$ ã‚’çµã¶ãƒ‘スã®ã†ã¡ã€é‡ã¿ã®ç·å’ŒãŒæœ€ã‚‚å°ã•ã„ã‚‚ã®ã¯ã©ã‚Œ
{{#tags}}- {{label}}
{{/tags}}