<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	
	>
<channel>
	<title>
	Comments on: 花花酱 LeetCode 127. Word Ladder	</title>
	<atom:link href="https://zxi.mytechroad.com/blog/searching/127-word-ladder/feed/" rel="self" type="application/rss+xml" />
	<link>https://zxi.mytechroad.com/blog/searching/127-word-ladder/</link>
	<description></description>
	<lastBuildDate>Tue, 18 Aug 2020 01:26:32 +0000</lastBuildDate>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.0.8</generator>
	<item>
		<title>
		By: BFS and Bi-directional BFS - shawnlyu		</title>
		<link>https://zxi.mytechroad.com/blog/searching/127-word-ladder/#comment-108</link>

		<dc:creator><![CDATA[BFS and Bi-directional BFS - shawnlyu]]></dc:creator>
		<pubDate>Tue, 18 Aug 2020 01:26:32 +0000</pubDate>
		<guid isPermaLink="false">http://zxi.mytechroad.com/blog/?p=415#comment-108</guid>

					<description><![CDATA[[&#8230;] Apart from vanilla BFS introduced in Intro to Graph Algorithms – BFS &#038; DFS, there&#8217;s another variant of BFS called bi-directional BFS. Instead of searching from source to target, bi-directional BFS starts with the source and the target at the same time, and search the graph simultaneously. The improvement of time complexities is shown as below, as referring to @Huahua. [&#8230;]]]></description>
			<content:encoded><![CDATA[<p>[&#8230;] Apart from vanilla BFS introduced in Intro to Graph Algorithms – BFS &amp; DFS, there&#8217;s another variant of BFS called bi-directional BFS. Instead of searching from source to target, bi-directional BFS starts with the source and the target at the same time, and search the graph simultaneously. The improvement of time complexities is shown as below, as referring to @Huahua. [&#8230;]</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: 752. Open the Lock &#8211; GCDLA		</title>
		<link>https://zxi.mytechroad.com/blog/searching/127-word-ladder/#comment-32</link>

		<dc:creator><![CDATA[752. Open the Lock &#8211; GCDLA]]></dc:creator>
		<pubDate>Tue, 02 Apr 2019 17:37:02 +0000</pubDate>
		<guid isPermaLink="false">http://zxi.mytechroad.com/blog/?p=415#comment-32</guid>

					<description><![CDATA[[&#8230;] Reference: http://zxi.mytechroad.com/blog/searching/127-word-ladder/ [&#8230;]]]></description>
			<content:encoded><![CDATA[<p>[&#8230;] Reference: <a href="http://zxi.mytechroad.com/blog/searching/127-word-ladder/" rel="nofollow ugc">http://zxi.mytechroad.com/blog/searching/127-word-ladder/</a> [&#8230;]</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: 127. Word Ladder &#8211; GCDLA		</title>
		<link>https://zxi.mytechroad.com/blog/searching/127-word-ladder/#comment-31</link>

		<dc:creator><![CDATA[127. Word Ladder &#8211; GCDLA]]></dc:creator>
		<pubDate>Sat, 30 Mar 2019 08:12:59 +0000</pubDate>
		<guid isPermaLink="false">http://zxi.mytechroad.com/blog/?p=415#comment-31</guid>

					<description><![CDATA[[&#8230;] Reference: http://zxi.mytechroad.com/blog/searching/127-word-ladder/ [&#8230;]]]></description>
			<content:encoded><![CDATA[<p>[&#8230;] Reference: <a href="http://zxi.mytechroad.com/blog/searching/127-word-ladder/" rel="nofollow ugc">http://zxi.mytechroad.com/blog/searching/127-word-ladder/</a> [&#8230;]</p>
]]></content:encoded>
		
			</item>
	</channel>
</rss>
