<?xml version="1.0" encoding="UTF-8"?>

<rdf:RDF
 xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
 xmlns="http://purl.org/rss/1.0/"
 xmlns:admin="http://webns.net/mvcb/"
 xmlns:content="http://purl.org/rss/1.0/modules/content/"
 xmlns:dc="http://purl.org/dc/elements/1.1/"
 xmlns:hatena="http://www.hatena.ne.jp/info/xmlns#"
 xmlns:syn="http://purl.org/rss/1.0/modules/syndication/"
 xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/"
>

<channel rdf:about="https://b.hatena.ne.jp/entry/s/rosettacode.org/wiki/Dijkstra&#x27;s_algorithm">
<title>&#x306F;&#x3066;&#x306A;&#x30D6;&#x30C3;&#x30AF;&#x30DE;&#x30FC;&#x30AF; - Dijkstra&#x27;s algorithm - Rosetta Code</title>
<link>https://b.hatena.ne.jp/entry/s/rosettacode.org/wiki/Dijkstra&#x27;s_algorithm</link>
<description>Dijkstra&#x27;s algorithm You are encouraged to solve this task according to the task description, using any language you may know. This task has been clarified. Its programming examples are in need of ...</description>
<items>
 <rdf:Seq>
  <rdf:li rdf:resource="https://b.hatena.ne.jp/System/20170821#bookmark-343771917" />
 </rdf:Seq>
</items>
</channel>
<item rdf:about="https://b.hatena.ne.jp/System/20170821#bookmark-343771917">
<title>System</title>
<link>https://b.hatena.ne.jp/System/20170821#bookmark-343771917</link>
<description></description>
<dc:date>2017-08-21T02:52:39Z</dc:date>
<dc:subject>Dijkstra</dc:subject>
<taxo:topics>
  <rdf:Bag>
    <rdf:li resource="https://b.hatena.ne.jp/q/Dijkstra" />
  </rdf:Bag>
</taxo:topics>
</item>
</rdf:RDF>