I need to find minimum spanning trees in a large graph using graph-viz. The number of nodes and edge information will be given in another text-file in 2 columns,"source" and "destination". please help.
Asked
Active
Viewed 395 times
1 Answers
1
Graphviz is principally a tool to layout graphs. The algorithms that are included relate to this task. The input for a graph is a graph specification.
What you need is a tool that computes the MST. There are several. The wikipedia article is a good start for references:
http://en.wikipedia.org/wiki/Prim's_algorithm
In python there is
In perl, I found
https://gist.github.com/hirotnk/780342
The SO answer here:
is also a good reference.
Given the output of an MST tool, you can general a file that is rendered by graphviz.
