✳flâneur — a map of the web's best reading

Graph Search | Course Readings | 6.101 Fall 2023

py.mit.edu · 24 words · saved by 1 readers

This reading is relatively new, and your feedback will help us improve it! If you notice mistakes (big or small), if you have questions, if anything is unclear, if there are things not covered here that you'd like to see covered, or if you have any other suggestions; please get in touch during office hours or open lab hours, or via e-mail at 6.101-help@mit.edu. In last week's reading, we looked at two related problems: flood fill (an operation on images for recoloring a contiguous region of similarly colored cells) and pathfinding (finding and returning a path through a maze, which we arrived at by modifying flood fill to keep track of additional information). In this reading, we'll be building on some of those ideas and formalizing them a little bit, looking at an interesting category of algorithms called graph search algorithms, which can be used to solve a wide variety of different problems. This reading will start at a high level, introducing and discussing graph search in the abst

Graph Search | Course Readings | 6.101 Fall 2023 Graph Search this page (from a previous semester) is no longer accessible, except for staff

Explore this link on the map →

related reading