<?xml version="1.0" encoding="UTF-8"?>
 <rdf:RDF xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:cc="http://web.resource.org/cc/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:admin="http://webns.net/mvcb/">
  <channel rdf:about="http://pinboard.in">
    <title>Pinboard (sweeney)</title>
    <link>https://pinboard.in/u:sweeney/public/</link>
    <description>recent bookmarks from sweeney</description>
    <items>
      <rdf:Seq>	<rdf:li rdf:resource="https://www.youtube.com/watch?v=bZe5J8SVCYQ"/>
	<rdf:li rdf:resource="http://www.calhoun.io/lets-learn-algorithms-implementing-binary-search/"/>
	<rdf:li rdf:resource="http://www.perl.com/pub/2004/04/08/bloom_filters.html"/>
	<rdf:li rdf:resource="http://optional.is/required/2011/01/12/maximum-color-contrast/"/>
	<rdf:li rdf:resource="http://stackoverflow.com/questions/483488/strategy-to-find-your-best-route-via-public-transportation-only"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="https://www.youtube.com/watch?v=bZe5J8SVCYQ">
    <title>The Missile Knows Where It Is... - YouTube</title>
    <dc:date>2020-02-12T10:24:41+00:00</dc:date>
    <link>https://www.youtube.com/watch?v=bZe5J8SVCYQ</link>
    <dc:creator>sweeney</dc:creator><dc:subject>algorithm missile guidance</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:sweeney/b:d2c7be58097f/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:sweeney/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:sweeney/t:missile"/>
	<rdf:li rdf:resource="https://pinboard.in/u:sweeney/t:guidance"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.calhoun.io/lets-learn-algorithms-implementing-binary-search/">
    <title>Let's Learn Algorithms: Implementing Binary Search Iteratively with Go</title>
    <dc:date>2016-12-02T14:51:11+00:00</dc:date>
    <link>http://www.calhoun.io/lets-learn-algorithms-implementing-binary-search/</link>
    <dc:creator>sweeney</dc:creator><dc:subject>go binarysearch algorithm</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:sweeney/b:5887e2c96391/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:sweeney/t:go"/>
	<rdf:li rdf:resource="https://pinboard.in/u:sweeney/t:binarysearch"/>
	<rdf:li rdf:resource="https://pinboard.in/u:sweeney/t:algorithm"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.perl.com/pub/2004/04/08/bloom_filters.html">
    <title>Using Bloom Filters - Perl.com</title>
    <dc:date>2016-05-09T17:04:53+00:00</dc:date>
    <link>http://www.perl.com/pub/2004/04/08/bloom_filters.html</link>
    <dc:creator>sweeney</dc:creator><dc:subject>bloom algorithm</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:sweeney/b:0e34abee0fb4/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:sweeney/t:bloom"/>
	<rdf:li rdf:resource="https://pinboard.in/u:sweeney/t:algorithm"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://optional.is/required/2011/01/12/maximum-color-contrast/">
    <title>Maximum Color Contrast « optional.is/required</title>
    <dc:date>2011-01-13T09:03:12+00:00</dc:date>
    <link>http://optional.is/required/2011/01/12/maximum-color-contrast/</link>
    <dc:creator>sweeney</dc:creator><dc:subject>tag colour algorithm contrast</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:sweeney/b:233b60987469/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:sweeney/t:tag"/>
	<rdf:li rdf:resource="https://pinboard.in/u:sweeney/t:colour"/>
	<rdf:li rdf:resource="https://pinboard.in/u:sweeney/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:sweeney/t:contrast"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://stackoverflow.com/questions/483488/strategy-to-find-your-best-route-via-public-transportation-only">
    <title>Strategy to find your best route via Public Transportation only? - Stack Overflow</title>
    <dc:date>2010-08-10T08:57:02+00:00</dc:date>
    <link>http://stackoverflow.com/questions/483488/strategy-to-find-your-best-route-via-public-transportation-only</link>
    <dc:creator>sweeney</dc:creator><description><![CDATA[ 7  down vote accepted
+100


I have been involved in development of one journy planner system for Stockholm Public Transportation in Sweden. It was based on Djikstra's algorithm but with termination before every node was visited in the system. Today when there are reliable coordinates available for each stop, I guess the A* algorithm would be the choise.]]></description>
<dc:subject>route algorithm</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:sweeney/b:082b548d64bf/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:sweeney/t:route"/>
	<rdf:li rdf:resource="https://pinboard.in/u:sweeney/t:algorithm"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>