<?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>Mon, 06 Apr 2026 03:56:01 GMT</lastBuildDate><atom:link href="http://direct.ecency.com/@josh-programming/rss" rel="self" type="application/rss+xml"/><item><title><![CDATA[An Introduction to (Computer Science) Graphs - How Google Maps Actually Works!]]></title><description><![CDATA[Unless you are a seasoned computer scientist, or a student trying to become one; you are probably unfamiliar with graphs. If I asked you to describe to me the graph below and what it means, you would probably]]></description><link>http://direct.ecency.com/technology/@josh-programming/an-introduction-to-computer-science-graphs-how-google-maps-actually-works</link><guid isPermaLink="true">http://direct.ecency.com/technology/@josh-programming/an-introduction-to-computer-science-graphs-how-google-maps-actually-works</guid><category><![CDATA[technology]]></category><dc:creator><![CDATA[josh-programming]]></dc:creator><pubDate>Thu, 30 Nov 2017 14:33:30 GMT</pubDate><enclosure url="https://images.ecency.com/p/LcTxR7u1XKae8Zaj594qUJafNyNSBw9svATPAkZ7xhwkGfzBC16uwdGddTaAfBYEabowj8B5tsAiigLU5asiAD75ywyEbFuFVvgWyStadimqQty1q1VYD9p2NYtFGjGHdLeRcN9NZAsaiKXKTKmo4C6za?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Breadth First Search (BFS) Algorithm with Queue Trace - Directed Graph Examplle]]></title><description><![CDATA[Today I am going over Breadth First Search or BFS. I was unable to find a tutorial on BFS that included a queue trace, so I decided to make one myself. If you have and questions on BFS or other graph traversal]]></description><link>http://direct.ecency.com/dtube/@josh-programming/flxnlv71</link><guid isPermaLink="true">http://direct.ecency.com/dtube/@josh-programming/flxnlv71</guid><category><![CDATA[dtube]]></category><dc:creator><![CDATA[josh-programming]]></dc:creator><pubDate>Wed, 15 Nov 2017 00:13:51 GMT</pubDate><enclosure url="https://images.ecency.com/p/46aP2QbqUqBqwzwxM6L1P6uLNceBDDCMCTQyxtqKMFXdzZbTrL87cY2F53yZNCbJ1QVp4U3XNt6Cvk4iEjXMm9phHdTV?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Learn Programming - Breadth First Search (BFS) - Finding the shortest path through a Maze!]]></title><description><![CDATA[I saw a few of you enjoyed my last post on DFS or Depth First Search, so I made a tutorial on it's sister algorithm Breadth First Search (BFS), check it out below: Computer scientists say this algorithm]]></description><link>http://direct.ecency.com/technology/@josh-programming/learn-programming-breadth-first-search-bfs-finding-the-shortest-path-through-a-maze</link><guid isPermaLink="true">http://direct.ecency.com/technology/@josh-programming/learn-programming-breadth-first-search-bfs-finding-the-shortest-path-through-a-maze</guid><category><![CDATA[technology]]></category><dc:creator><![CDATA[josh-programming]]></dc:creator><pubDate>Tue, 14 Nov 2017 15:00:30 GMT</pubDate><enclosure url="https://images.ecency.com/p/S5Eokt4BcQdk7EHeT1aYjzebg2hC7hkthT45e2edpje8m3dMkXNeg56sN7CHgwJzzbwHNRc?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Depth First Search (DFS) with Stack Trace Tutorial]]></title><description><![CDATA[Today I am going over Depth First Search or DFS. I was unable to find a tutorial on DFS that included a stack trace, so I decided to make one myself. If you have any questions on DFS or other graph traversal]]></description><link>http://direct.ecency.com/dtube/@josh-programming/n21q5ufy</link><guid isPermaLink="true">http://direct.ecency.com/dtube/@josh-programming/n21q5ufy</guid><category><![CDATA[dtube]]></category><dc:creator><![CDATA[josh-programming]]></dc:creator><pubDate>Mon, 13 Nov 2017 01:43:30 GMT</pubDate><enclosure url="https://images.ecency.com/p/mXkfdToSwHy8jids4vLdR7JmGKicDFWgZWnhwA45mXrH5L2Wd89Xdwt7FnBRXMBEgk3XV6tJ9q6gU8jWsnMKxYtKA63cXXYyGUby8t9c1?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Learn Programming - Depth First Search (DFS) - Maze Solving Algorithm]]></title><description><![CDATA[As a crypto fanatic and programmer, I thought steemit would be a great platform to introduce my intro to programming series. In this video, we are talking about graph traversal algorithms (maze solving]]></description><link>http://direct.ecency.com/technology/@josh-programming/learn-programming-depth-first-search-dfs-maze-solving-algorithm</link><guid isPermaLink="true">http://direct.ecency.com/technology/@josh-programming/learn-programming-depth-first-search-dfs-maze-solving-algorithm</guid><category><![CDATA[technology]]></category><dc:creator><![CDATA[josh-programming]]></dc:creator><pubDate>Sun, 12 Nov 2017 23:45:06 GMT</pubDate><enclosure url="https://images.ecency.com/p/S5Eokt4BcQdk7EHeT1aYjzebg2hC7hkthT45e3T3ZU3rsUSYQC7n51cBKYh87BgqVx3M6AA?format=match&amp;mode=fit" length="0" type="false"/></item></channel></rss>