<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[RSS Feed]]></title><description><![CDATA[RSS Feed]]></description><link>http://direct.ecency.com</link><image><url>http://direct.ecency.com/logo512.png</url><title>RSS Feed</title><link>http://direct.ecency.com</link></image><generator>RSS for Node</generator><lastBuildDate>Sun, 12 Apr 2026 21:23:32 GMT</lastBuildDate><atom:link href="http://direct.ecency.com/@vamshikshetty/rss" rel="self" type="application/rss+xml"/><item><title><![CDATA[Uniform Cost Search for Graph]]></title><description><![CDATA[Requirements: BFS DFS Uniform Cost Search is the best algorithm for a search problem, which does not involve the use of heuristic function. UCS finds the optimal path between the two nodes in directed]]></description><link>http://direct.ecency.com/algorithm/@vamshikshetty/uniform-cost-search-for-graph</link><guid isPermaLink="true">http://direct.ecency.com/algorithm/@vamshikshetty/uniform-cost-search-for-graph</guid><category><![CDATA[algorithm]]></category><dc:creator><![CDATA[vamshikshetty]]></dc:creator><pubDate>Fri, 27 Oct 2017 22:48:15 GMT</pubDate><enclosure url="https://images.ecency.com/p/99pyU5Ga1kws91ecJjkANAzfstp5ietJ4ACvk9NVUQjXbsMSSc6i5XghefADqs7tH1N1xo6LBYGzKjXNkYaMuCiPLzA2Ecks7hx3r3e27P799Zn2L3LZda7vvTPNnihHXk?format=match&amp;mode=fit" length="0" type="false"/></item></channel></rss>