On 05/16/2012 11:43 AM, wren ng thornton wrote:
On 5/12/12 8:52 AM, Sönke Hahn wrote:
Any comments or suggestions?
Cabalize it and release it on Hackage. But especially the cabalization
part :)
Both done:
http://hackage.haskell.org/package/darcs2dot
On 05/13/2012 04:16 PM, Francesco Mazzoli wrote:
I found Gephi (https://gephi.org/) quite good when I had to visualize
big graphs, and it supports dot files so you can try it out easily.
gephi looks very interesting, thanks.
___
Haskell-Cafe mailing
On 05/14/2012 04:21 PM, Simon Michael wrote:
In a 2000-patch repo it took 22 hours:
http://joyful.com/darcsden/simon/hledger/raw/patchdeps.pdf
:)
It should escape double-quotes in patch names, I did that manually.
That should be fixed (in the repo).
On 05/16/2012 11:43 AM, wren ng thornton wrote:
Also, have you compared your transitive reduction to just outputting the
whole graph and then using `tred`? The latter approach has the distinct
downside of needing to serialize the whole graph; but it could still be
a win unless you intend to
On 5/12/12 8:52 AM, Sönke Hahn wrote:
Any comments or suggestions?
Cabalize it and release it on Hackage. But especially the cabalization
part :)
You should probably farm out the toDot rendering to one of the libraries
that focuses on that[1], since they'll have focused on the efficiency
On 16 May 2012 19:43, wren ng thornton w...@freegeek.org wrote:
On 5/12/12 8:52 AM, Sönke Hahn wrote:
Any comments or suggestions?
Cabalize it and release it on Hackage. But especially the cabalization part
:)
You should probably farm out the toDot rendering to one of the libraries
that
On 16 May 2012 19:43, wren ng thornton w...@freegeek.org wrote:
You should probably farm out the toDot rendering to one of the libraries
that focuses on that[1], since they'll have focused on the efficiency
issues--- or if they haven't, then you can contribute improvements there,
helping
On 17 May 2012 03:31, Stephen Tetley stephen.tet...@gmail.com wrote:
On 16 May 2012 19:43, wren ng thornton w...@freegeek.org wrote:
You should probably farm out the toDot rendering to one of the libraries
that focuses on that[1], since they'll have focused on the efficiency
issues--- or if
Hi,
Am Montag, den 14.05.2012, 07:21 -0700 schrieb Simon Michael:
I wonder how to simplify the graph further. Perhaps just the dependencies of
tags would be interesting in some repos ?
I think you’d want to collapse [a]→[b] to [a,b], if no other edges leave
a or reach b. This way you only get
Sönke Hahn sh...@cs.tu-berlin.de writes:
On 05/13/2012 03:13 AM, Felipe Almeida Lessa wrote:
Truly amazing!
Yes, nice work!
I wonder it would fare with larger repositories. =)
It does not scale well. [...]
Somehow related questions are: What am I going to do with a dot-graph,
that has
On 5/12/12 5:52 AM, Sönke Hahn wrote:
Hi all!
Yesterday I wrote a little tool to output the dependencies of darcs
patches in dot format. The hardest part was to wrap my head around the
darcs API and find a way to let it compute the patch dependencies. I
don't know, if I got it right, but it
On 05/13/2012 03:13 AM, Felipe Almeida Lessa wrote:
Truly amazing! I wonder it would fare with larger repositories. =)
It does not scale well. I have not looked into optimization at all. For
example the algorithm to compute the transitive reduction is very naive
and brute force.
Somehow related
On 13/05/12 14:55, Sönke Hahn wrote:
Somehow related questions are: What am I going to do with a dot-graph,
that has more than 500 vertices? Is there an intelligent way to reduce
the graph?
Setting the `concentrate' parameter to true helps, but dot does not work
well with massive graphs.
On 13/05/12 15:13, Francesco Mazzoli wrote:
On 13/05/12 14:55, Sönke Hahn wrote:
Somehow related questions are: What am I going to do with a dot-graph,
that has more than 500 vertices? Is there an intelligent way to reduce
the graph?
Setting the `concentrate' parameter to true helps, but dot
Hi all!
Yesterday I wrote a little tool to output the dependencies of darcs
patches in dot format. The hardest part was to wrap my head around the
darcs API and find a way to let it compute the patch dependencies. I
don't know, if I got it right, but it looks correct at first glance.
Here is the
Truly amazing! I wonder it would fare with larger repositories. =)
Cheers,
--
Felipe – enviado do meu Galaxy Tab.
Em 12/05/2012 09:52, Sönke Hahn sh...@cs.tu-berlin.de escreveu:
Hi all!
Yesterday I wrote a little tool to output the dependencies of darcs
patches in dot format. The hardest
16 matches
Mail list logo
