{"id":3753,"date":"2010-09-08T13:50:55","date_gmt":"2010-09-08T13:50:55","guid":{"rendered":"https:\/\/blogs.msdn.microsoft.com\/vcblog\/2010\/09\/08\/video-introduction-to-the-stl-part-4\/"},"modified":"2019-02-18T18:45:27","modified_gmt":"2019-02-18T18:45:27","slug":"video-introduction-to-the-stl-part-4","status":"publish","type":"post","link":"https:\/\/devblogs.microsoft.com\/cppblog\/video-introduction-to-the-stl-part-4\/","title":{"rendered":"Video Introduction to the STL, Part 4"},"content":{"rendered":"

In the fourth part<\/a> of my video lecture series introducing the Standard Template Library, I walk through an extended example of using the STL to solve Nurikabe puzzles.  It assumes that you’ve read Wikipedia’s Nurikabe<\/a> page, and that you’ve watched Part 1<\/a> (sequence containers), Part 2<\/a> (associative containers), and Part 3<\/a> (smart pointers), or that you’re already familiar with those topics.<\/p>\n

<\/span><\/p>\n

<\/p>\n

 <\/p>\n

<\/span><\/p>\n

My original source code<\/a> and output<\/a> are available.  I’ve been working on improving them, and I’m up to version 1.2<\/a>.<\/p>\n

<\/span><\/p>\n

<\/p>\n

 <\/p>\n

<\/span><\/p>\n

In Part 5 (which was filmed back-to-back; it’s in the editing pipeline), I’ll explain how I implemented the advanced analysis in my Nurikabe solver, including the first breadth-first search that I ever wrote.<\/p>\n

<\/span><\/p>\n

<\/p>\n

 <\/p>\n

<\/span><\/p>\n

Stephan T. Lavavej<\/p>\n

<\/span><\/p>\n

Visual C++ Libraries Developer<\/span><\/p><\/p>\n","protected":false},"excerpt":{"rendered":"

In the fourth part of my video lecture series introducing the Standard Template Library, I walk through an extended example of using the STL to solve Nurikabe puzzles.  It assumes that you’ve read Wikipedia’s Nurikabe page, and that you’ve watched Part 1 (sequence containers), Part 2 (associative containers), and Part 3 (smart pointers), or that […]<\/p>\n","protected":false},"author":289,"featured_media":35994,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"footnotes":""},"categories":[1],"tags":[9,3,32],"class_list":["post-3753","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-cplusplus","tag-channel-9","tag-dev","tag-stl"],"acf":[],"blog_post_summary":"

In the fourth part of my video lecture series introducing the Standard Template Library, I walk through an extended example of using the STL to solve Nurikabe puzzles.  It assumes that you’ve read Wikipedia’s Nurikabe page, and that you’ve watched Part 1 (sequence containers), Part 2 (associative containers), and Part 3 (smart pointers), or that […]<\/p>\n","_links":{"self":[{"href":"https:\/\/devblogs.microsoft.com\/cppblog\/wp-json\/wp\/v2\/posts\/3753","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/devblogs.microsoft.com\/cppblog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/devblogs.microsoft.com\/cppblog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/devblogs.microsoft.com\/cppblog\/wp-json\/wp\/v2\/users\/289"}],"replies":[{"embeddable":true,"href":"https:\/\/devblogs.microsoft.com\/cppblog\/wp-json\/wp\/v2\/comments?post=3753"}],"version-history":[{"count":0,"href":"https:\/\/devblogs.microsoft.com\/cppblog\/wp-json\/wp\/v2\/posts\/3753\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/devblogs.microsoft.com\/cppblog\/wp-json\/wp\/v2\/media\/35994"}],"wp:attachment":[{"href":"https:\/\/devblogs.microsoft.com\/cppblog\/wp-json\/wp\/v2\/media?parent=3753"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/devblogs.microsoft.com\/cppblog\/wp-json\/wp\/v2\/categories?post=3753"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/devblogs.microsoft.com\/cppblog\/wp-json\/wp\/v2\/tags?post=3753"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}