<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[RSS Feed]]></title><description><![CDATA[RSS Feed]]></description><link>https://ecency.com</link><image><url>https://ecency.com/logo512.png</url><title>RSS Feed</title><link>https://ecency.com</link></image><generator>RSS for Node</generator><lastBuildDate>Sat, 04 Jul 2026 15:18:27 GMT</lastBuildDate><atom:link href="https://ecency.com/created/graph-theory/rss.xml" rel="self" type="application/rss+xml"/><item><title><![CDATA[How to find a second best Minimum Spanning Tree]]></title><description><![CDATA[A Minimum Spanning Tree (MST) of a weighted graph G(V, E) is a tree obtained by removing some edges in G such that the sum of the weights of the resulting tree's edges is as small as possible. In this]]></description><link>https://ecency.com/@ivlad/how-to-find-a-second-best-minimum-spanning-tree</link><guid isPermaLink="true">https://ecency.com/@ivlad/how-to-find-a-second-best-minimum-spanning-tree</guid><category><![CDATA[algorithms]]></category><dc:creator><![CDATA[ivlad]]></dc:creator><pubDate>Mon, 26 Mar 2018 21:14:24 GMT</pubDate></item></channel></rss>