EnglishFrenchSpanish

OnWorks favicon

Satsuma .NET Graph Library

Free download Satsuma .NET Graph Library Linux app to run online in Ubuntu online, Fedora online or Debian online

This is the Linux app named Satsuma .NET Graph Library whose latest release can be downloaded as Satsuma_0.6beta_bin+src+doc.zip. It can be run online in the free hosting provider OnWorks for workstations.

Download and run online this app named Satsuma .NET Graph Library with OnWorks for free.

Follow these instructions in order to run this app:

- 1. Downloaded this application in your PC.

- 2. Enter in our file manager https://www.onworks.net/myfiles.php?username=XXXXX with the username that you want.

- 3. Upload this application in such filemanager.

- 4. Start the OnWorks Linux online or Windows online emulator or MACOS online emulator from this website.

- 5. From the OnWorks Linux OS you have just started, goto our file manager https://www.onworks.net/myfiles.php?username=XXXXX with the username that you want.

- 6. Download the application, install it and run it.

Satsuma .NET Graph Library


Ad


DESCRIPTION

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.

DOCUMENTATION: http://satsumagraph.sourceforge.net/

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.

Features

  • 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


Audience

Information Technology, Science/Research



Programming Language

C#, Visual Basic .NET



This is an application that can also be fetched from https://sourceforge.net/projects/satsumagraph/. It has been hosted in OnWorks in order to be run online in an easiest way from one of our free Operative Systems.


Ad