<?xml version="1.0" encoding="UTF-8"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
<channel>
  <title>e-sygoing.link — Software</title>
  <link>https://e-sygoing.link</link>
  <description>Latest links in the Software category</description>
  <language>en-us</language>
  <lastBuildDate>Sun, 24 May 2026 00:48:09 -0400</lastBuildDate>
  <atom:link href="https://e-sygoing.link/rss.php?type=new&amp;cid=61592"
             rel="self" type="application/rss+xml"/>
    <item>
    <title>The LEDA Library</title>
    <link>https://e-sygoing.link/link/5283602-the-leda-library</link>
    <description>LEDA is a library of the data types and algorithms of combinatorial computing.</description>
    <pubDate>Sat, 09 May 2026 19:37:11 -0400</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5283602</guid>
  </item>
    <item>
    <title>Combinatorics Software of the Algorithms Project</title>
    <link>https://e-sygoing.link/link/5283610-combinatorics-software-of-the-algorithms-project</link>
    <description>Combinatorial analysis, discrete mathematics and computer algebra are the main interests of the Algorithms Projects. The packages let you define combinatorial structures; manipulate the associated generating functions, functional equations or recurrences; study their asymptotic behaviour.</description>
    <pubDate>Tue, 17 Feb 2026 22:46:28 -0500</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5283610</guid>
  </item>
    <item>
    <title>plantri and fullgen</title>
    <link>https://e-sygoing.link/link/5283606-plantri-and-fullgen</link>
    <description>Programs for generation of certain types of planar graph, generated in such a way that exactly one member of each isomorphism  class is output without the need for storing them.</description>
    <pubDate>Tue, 03 Feb 2026 19:58:14 -0500</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5283606</guid>
  </item>
    <item>
    <title>Graph Coloring By DSATUR</title>
    <link>https://e-sygoing.link/link/5283613-graph-coloring-by-dsatur</link>
    <description>By using the DSATUR algorithm, this php/form colors any graph in the Dimacs format.</description>
    <pubDate>Sat, 24 Jan 2026 01:12:27 -0500</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5283613</guid>
  </item>
    <item>
    <title>Nauty</title>
    <link>https://e-sygoing.link/link/5283601-nauty</link>
    <description>A program for computing automorphism groups of graphs and digraphs. It  can also produce a canonical labelling.</description>
    <pubDate>Fri, 26 Dec 2025 15:06:01 -0500</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5283601</guid>
  </item>
    <item>
    <title>JGraphT</title>
    <link>https://e-sygoing.link/link/5283614-jgrapht</link>
    <description>Free Java class library that provides mathematical graph-theory objects and algorithms.</description>
    <pubDate>Wed, 18 Jun 2025 07:20:01 -0400</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5283614</guid>
  </item>
    <item>
    <title>GOBLIN Graph Library</title>
    <link>https://e-sygoing.link/link/5283618-goblin-graph-library</link>
    <description>C++ library of graph optimization algorithms with a GUI for editing, running and tracing the algorithms.</description>
    <pubDate>Fri, 31 Jan 2025 03:28:23 -0500</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5283618</guid>
  </item>
    <item>
    <title>Free Software in Graph Theory</title>
    <link>https://e-sygoing.link/link/5283603-free-software-in-graph-theory</link>
    <description>Free Software for Win 9X,NT on Graph Theory by Vitali Petchenkine.  Procedures:       Metrics of the graph;        Paths and cycles;       Colorations;       Automorphism group;        Minimal spanning tree;        Shortest paths;        Max. Capacity path;       K Shortest paths;        Salesman problem;        Maximal flow;        Critical path;  Reports for Graphs;  Print.</description>
    <pubDate>Mon, 28 Oct 2024 13:52:57 -0400</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5283603</guid>
  </item>
    <item>
    <title>Graph Partitioners</title>
    <link>https://e-sygoing.link/link/5283623-graph-partitioners</link>
    <description>Three algorithms written in NESL for finding separators of graphs, in order to compare the quality of the cuts.</description>
    <pubDate>Fri, 22 Mar 2024 23:22:34 -0400</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5283623</guid>
  </item>
    <item>
    <title>GRAPE</title>
    <link>https://e-sygoing.link/link/5283617-grape</link>
    <description>A GAP package for computing with graphs; primarily designed for the efficient construction and analysis of graphs related to groups, combinatorial designs and finite geometries.</description>
    <pubDate>Thu, 29 Feb 2024 06:52:06 -0500</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5283617</guid>
  </item>
  </channel>
</rss>
