1

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.

5
  • possible duplicate of .NET graph library around? Commented Apr 21, 2011 at 18:59
  • 1
    QuickGraph Commented Apr 21, 2011 at 19:00
  • @JasonTrue, I don't need graphic capabilities and I'm looking for another algorithms. Commented Apr 21, 2011 at 19:01
  • 1
    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. Commented Apr 21, 2011 at 19:01
  • Ok, I have read another post and looked at QuickGraph. But I found only finding a minimum spanning tree algorithms... Commented Apr 21, 2011 at 19:05

2 Answers 2

1

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.

Sign up to request clarification or add additional context in comments.

Comments

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.

Comments

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.