<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="FeedCreator 1.8" -->
<?xml-stylesheet href="https://wiki.binni.org/lib/exe/css.php?s=feed" type="text/css"?>
<rdf:RDF
    xmlns="http://purl.org/rss/1.0/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
    xmlns:dc="http://purl.org/dc/elements/1.1/">
    <channel rdf:about="https://wiki.binni.org/feed.php">
        <title>Brynjar's Notebook compsci:algorithms</title>
        <description></description>
        <link>https://wiki.binni.org/</link>
        <image rdf:resource="https://wiki.binni.org/lib/tpl/bootstrap3/images/favicon.ico" />
       <dc:date>2026-08-09T17:22:45+0000</dc:date>
        <items>
            <rdf:Seq>
                <rdf:li rdf:resource="https://wiki.binni.org/compsci:algorithms:datastructures?rev=1586439091&amp;do=diff"/>
                <rdf:li rdf:resource="https://wiki.binni.org/compsci:algorithms:graphtheory?rev=1587309306&amp;do=diff"/>
            </rdf:Seq>
        </items>
    </channel>
    <image rdf:about="https://wiki.binni.org/lib/tpl/bootstrap3/images/favicon.ico">
        <title>Brynjar's Notebook</title>
        <link>https://wiki.binni.org/</link>
        <url>https://wiki.binni.org/lib/tpl/bootstrap3/images/favicon.ico</url>
    </image>
    <item rdf:about="https://wiki.binni.org/compsci:algorithms:datastructures?rev=1586439091&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2020-04-09T13:31:31+0000</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>compsci:algorithms:datastructures</title>
        <link>https://wiki.binni.org/compsci:algorithms:datastructures?rev=1586439091&amp;do=diff</link>
        <description>Data Structures

Data Types

	*  Scalars
	*  Sequences
	*  Vectors
	*  Sets
	*  Stacks
	*  Queues
	*  Maps / Dicts
	*  Ordered Maps / Dicts
	*  Priority Queues

Data Structures

	*  Array
	*  Linked list (single, double, linear, circular)
	*  Binary search tree</description>
    </item>
    <item rdf:about="https://wiki.binni.org/compsci:algorithms:graphtheory?rev=1587309306&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2020-04-19T15:15:06+0000</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>compsci:algorithms:graphtheory</title>
        <link>https://wiki.binni.org/compsci:algorithms:graphtheory?rev=1587309306&amp;do=diff</link>
        <description>Graph Theory

A graph is a mathematical structure that models pairwise relations between objects. The objects are represented as vertices and relations between two objects are represented with edges. For example, a road network could be described with a graph, where the cities are vertices and the roads between them are edges.$G = (V,E)$$V$$E$$(u,v)$$u,v \in V$$u$$v$$E$$(u,v)$$u$$v$$u \to v$$E$$u$$v$$(u,v) \in E$$u$$v$$u$$G' = (E', V')$$G = (E,V)$$E' \subseteq E$$V' \subseteq V$$G' \not=G$$G'$$G…</description>
    </item>
</rdf:RDF>
