Satsuma .NET Graph Library Icon

Satsuma .NET Graph Library


a delicious .NET graph library

5.0 Stars (1)
7 Downloads (This Week)
Last Update:
Browse All Files


Satsuma is a graph library for .NET, written in C#. Satsuma is an easy-to-use and flexible library, which implements all the necessary graph structures, and the fastest possible graph algorithms.


Satsuma is not a charting library. 'Graph' is used in the mathematical sense here (e.g. nodes connected with arcs).

Satsuma is released under the zlib license. This license is very permissive and allows you to use Satsuma for both personal and commercial purposes.

Satsuma .NET Graph Library Web Site


  • Dfs and basic connectivity algorithms
  • Path finding (Bfs, Dijkstra, Bellman-Ford, A*)
  • Spanning forests (Kruskal, Prim)
  • Graph adaptors: classes which temporarily modify graphs (contract nodes, take a subgraph/supergraph, reverse arcs, undirect arcs, etc.)
  • Circulations (max flow with the Preflow algorithm, min cost circulation with the Network Simplex method)
  • Matchings in bipartite graphs (maximum matching, minimum cost matching)
  • TSP solvers (insertion, cheapest link, 2-OPT)
  • I/O: loading/saving graphs
  • Drawing graphs


Other Useful Business Software

The Sight of Sound Icon

­ Improve VoIP Visibility from SIP to RTP

The Sight of Sound Icon
Cloud­based voice solutions are common in enterprise networks and frustrating for operations teams to manage. Simplify VoIP monitoring by having a proactive analysis of on-prem, hybrid and UCaaS voice services. Try the ThousandEyes VoIP monitoring solution today, free.

User Ratings

ease 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 5 / 5
features 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 5 / 5
design 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 5 / 5
support 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 5 / 5
Write a Review

User Reviews

  • 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5

    Hi, I have started using your library and I am very thankful for it. I would like to ask how to use AStar algorithm, but not with a CompleteGraph. What I would like to do is to create a graph manually, add nodes and arc (edges) and the perform shortest path algorithm from node a to b. Then get the path as node list. How can I do this? Thank you, Petras

    Posted 09/26/2016
Read more reviews

Additional Project Details

Intended Audience

Information Technology, Science/Research

Programming Language

C#, Visual Basic .NET



Thanks for helping keep SourceForge clean.

Screenshot instructions:
Red Hat Linux   Ubuntu

Click URL instructions:
Right-click on ad, choose "Copy Link", then paste here →
(This may not be possible with some types of ads)

More information about our ad policies

Briefly describe the problem (required):

Upload screenshot of ad (required):
Select a file, or drag & drop file here.

Please provide the ad click URL, if possible:

Get latest updates about Open Source Projects, Conferences and News.

Sign up for the SourceForge newsletter:

JavaScript is required for this form.

No, thanks