Flood fill is used for typically finding shortest paths. It is a combination of dynamic programming and breast first search.

kenzan8000 のブックマーク 2020/05/24 15:34

<blockquote class="hatena-bookmark-comment"><a class="comment-info" href="https://b.hatena.ne.jp/entry/4686147677143991042/comment/kenzan8000" data-user-id="kenzan8000" data-entry-url="https://b.hatena.ne.jp/entry/s/www.youtube.com/watch?v=Zwh-QNlsurI" data-original-href="https://www.youtube.com/watch?v=Zwh-QNlsurI" data-entry-favicon="https://cdn-ak2.favicon.st-hatena.com/64?url=https%3A%2F%2Fwww.youtube.com%2Fwatch%3Fv%3DZwh-QNlsurI" data-user-icon="/users/kenzan8000/profile.png">Dynamic Programming / Flood Fill Algorithm</a><ul class="comment-tag" style="list-style: none; margin: 0px;"><li style="float: left">[<a href="https://b.hatena.ne.jp/q/%22flood%20fill%22">flood fill</a>]</li><li style="float: left">[<a href="https://b.hatena.ne.jp/q/bfs">bfs</a>]</li><li style="float: left">[<a href="https://b.hatena.ne.jp/q/backtracking">backtracking</a>]</li><li style="float: left">[<a href="https://b.hatena.ne.jp/q/%22dynamic%20programming%22">dynamic programming</a>]</li><li style="float: left">[<a href="https://b.hatena.ne.jp/q/%22data%20structure%22">data structure</a>]</li><li style="float: left">[<a href="https://b.hatena.ne.jp/q/algorithm">algorithm</a>]</li><li style="float: left">[<a href="https://b.hatena.ne.jp/q/%22computer%20science%22">computer science</a>]</li></ul><br><p style="clear: left"> Flood fill is used for typically finding shortest paths. It is a combination of dynamic programming and breast first search.</p><a class="datetime" href="https://b.hatena.ne.jp/kenzan8000/20200524#bookmark-4686147677143991042"><span class="datetime-body">2020/05/24 15:34</span></a></blockquote><script src="https://b.st-hatena.com/js/comment-widget.js" charset="utf-8" async></script>

このブックマークにはスターがありません。
最初のスターをつけてみよう！