<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
	<channel>
		<title>Graph-Theory on unordered</title>
		<link>https://unorde.red/categories/graph-theory/</link>
		<description>Recent content in Graph-Theory on unordered</description>
		<generator>Hugo</generator>
		<language>en-US</language>
		
		
		
		
			<lastBuildDate>Sun, 12 Mar 2017 00:00:00 +0000</lastBuildDate>
		
			<atom:link href="https://unorde.red/categories/graph-theory/feed.xml" rel="self" type="application/rss+xml" />
			<item>
				<title>Topological sorts</title>
				<link>https://unorde.red/topological-sorts/</link>
				<pubDate>Sun, 12 Mar 2017 00:00:00 +0000</pubDate>
				<guid>https://unorde.red/topological-sorts/</guid>
				<description>&lt;p&gt;Detecting and finding cycles in directed graphs are common problems in graph theory. A while back I was looking for an algorithm to detect whether a graph had a cycle or not, and it turns out there are a lot of different ways to approach this. Ultimately, the best method to use will probably depend on why you&amp;rsquo;re looking for cycles, and what you want to do with them (or their absence).&lt;/p&gt;</description>
			</item>
	</channel>
</rss>
