C# graphs algorithms library

Question

I'm looking for .NET library with the next graphs algorithms:

algorithm for finding a minimum spanning tree;
algorithm for partitioning graph for N subgraphs with minimal number of connections.

I can write my own realization, but don't have too much time. Tell me, please, names of any existing libraries that can do this. Thanks.

possible duplicate of [.NET graph library around?](http://stackoverflow.com/questions/1578493/net-graph-library-around) — JasonTrue, Apr 21 '11 at 18:59
@JasonTrue, I don't need graphic capabilities and I'm looking for another algorithms. — kyrylomyr, Apr 21 '11 at 19:01
You should read the answers to the other question more carefully, then. The graph libraries mentioned are primarily about the algorithms, though the other person wanted visualization in addition to the algorithms. QuickGraph, the accepted answer on that question, is what you want. — JasonTrue, Apr 21 '11 at 19:01
Ok, I have read another post and looked at QuickGraph. But I found only finding a minimum spanning tree algorithms... — kyrylomyr, Apr 21 '11 at 19:05

score 1 · Answer 1 · answered Apr 23 '11 at 18:49

yWorks provides several products for .NET Depending on where you plan on deploying you can choose your flavor and perform lots of analyses on the graph. Although I'm not fond of the API (a bit too java-ish), the biggest disadvantage is definitely the price.

score 1 · Accepted Answer · answered Aug 18 '11 at 08:43

1

The best solution was to use QuickGraph library. It already has algorithm for finding a minimum spanning tree. And I used their implementation of graph to write my own algorithm for partitioning it.

answered Aug 18 '11 at 08:43

kyrylomyr

12,192
8
52
79

C# graphs algorithms library

2 Answers2