<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>kanguros on ulno.net</title><link>https://ulno.net/kanguros/</link><description>Recent content in kanguros on ulno.net</description><generator>Hugo</generator><language>en</language><lastBuildDate>Tue, 06 Oct 2026 21:45:53 +0200</lastBuildDate><atom:link href="https://ulno.net/kanguros/index.xml" rel="self" type="application/rss+xml"/><item><title>solution</title><link>https://ulno.net/kanguros/solution/</link><pubDate>Sun, 06 Mar 2011 00:00:00 +0100</pubDate><guid>https://ulno.net/kanguros/solution/</guid><description>&lt;h1 id="kanguros-solution"&gt;KangurOS Solution&lt;/h1&gt;&#10;&lt;p&gt;The graph, which I have in mind has directed edges which always connect &lt;em&gt;three&lt;/em&gt; vertices. In such a connection, each vertex corresponds to either a subject, the predicate, or the object (like in the semantic web). In another relation, this vertex could also have a different role. This means we have a universe U of objects and a relation R={(x,y,z)|x,y,z el. of U} We decided to use this:&lt;/p&gt;</description></item></channel></rss>