graphviz

10 ms·

61.
by graphviz 5y ago
Inside every large graph is a small graph dying to get out. There's a place for just wanting to see everything, but the beauty of graphs is abstraction. Sometimes if you are asking a specific questions, a small, beautiful graph might
62.
by graphviz 5y ago
We always had trouble with that too. Wasn't there another YC thread in the last couple of days about exactly this problem in typography.
63.
by graphviz 5y ago
You are drawing large graphs by hand? ML approaches to graph layout are very exciting, since the constraints people need in real life diagrams are quite intricate, but it's still a research problem.
64.
by graphviz 5y ago
That DFS is in the network simplex algorithm that solves node coordinates. Some nice clever person could probably code up that clever algorithm of Brandes and Köpf, https://link.springer.com/chapter/10.1007/3-540-4
65.
by graphviz 5y ago
Sure it is
66.
by graphviz 5y ago
Heh heh. It would probably be helpful to the community if we could add a layout plugin to allow users to specify layouts in some absolute or relative grid format, to avoid all the invisible edge and edge length hackery. We just need appropr
67.
by graphviz 5y ago
Do you mean Yu, Schumacher and Crane's repulsive curves, as shown in figure 26 of https://www.cs.cmu.edu/~kmcrane/Projects/RepulsiveCurves/Rep... ?
68.
by graphviz 5y ago
When we started Graphviz, we vaguely sensed the potential for graph databases or environments, like neo4j, but we didn't work much in that area. It would take more resources, or intensity, than what we had. Anyway, gvpr is a modest at
69.
by graphviz 5y ago
Most of the work has been on CI/CD, Windows, rationalizing and modernizing the code, and Zheng, Pawar and Goodman contributed a stochastic gradient descent solver, described here, https://arxiv.org/abs/1710.04626
70.
by graphviz 5y ago
Author(s) here. Ask us anything.
71.
by graphviz 5y ago
Author(s) here We do voluntarily act on CERT advisories. But, true.
72.
by graphviz 5y ago
Oh, that too. Feature interaction is a killer, isn't it.
73.
by graphviz 5y ago
"Very poor" seems harsh, but, yes, it hurts us, too. (That, and text with slightly-off baselines.) The relevant code starts around https://gitlab.com/graphviz/graphviz/-/blob/main/lib/
74.
by graphviz 5y ago
Also, this is a great problem, and we tried to solve it in a more general context. http://dpd.cs.princeton.edu/Papers/DGKN97.pdf I believe it's an open problem what makes a curve look "natural" or how to
75.
by graphviz 5y ago
Agree.
76.
by graphviz 5y ago
nice
77.
by graphviz 5y ago
Amazing. Cookbooks are still in fashion, too.
78.
by graphviz 5y ago
It's not often that one can comment on "gratuitous use of 4D".
79.
by graphviz 5y ago
Someone on the internet is wrong! Or maybe just partially correct. This is very interesting work. There is some selling going on, not discussing enough about the issues that drove the database community toward relational databases and away
80.
by graphviz 5y ago
It's not that it can't be done, it's that the community went in a different direction, and there's a strong cultural bias. Bell Labs internally had a "new make" written by Glenn Fowler, that went full bore into
81.
by graphviz 5y ago
(30 years and 1500K lines of code later) yes that's somewhat true
82.
by graphviz 5y ago
Specifically which new algorithms would you like to see? A difficulty is that implementation is harder than a typical student project, and we need some decent developer documentation.
83.
by graphviz 6y ago
It's a good observation that a lot of people want "diagrams", not separate, incompatible graph layouts, scatter plots, maps, histograms, radar charts, and everything else. Grammar based libraries and tools are starting to fil
84.
by graphviz 6y ago
Better Treemap visualization? e.g. https://www.d3-graph-gallery.com/treemap These are a feature in Tableau, https://help.tableau.com/current/pro/desktop/en-us/buildexam... and PowerBI
85.
by graphviz 6y ago
Yes, force-directed layout doesn't consider number of crossings. dot is the only graphviz program that reduces crossings, and because of the level assignment constraint, even small graphs like K_4 or K_2,2 have crossings that could be
86.
by graphviz 6y ago
This is an excellent idea. In general, allowing a human to say they would like to expend more machine cycles to search for better renderings would be useful. This would be an interesting summer intern project, It could probably be layered
87.
by graphviz 6y ago
We're reluctant to be exposed to too much anger about misfeatures in 20 year old code that was basically a prototype that escaped from the lab, but go ahead, ask us anything. We've gotten a lot of help lately from Magnus Jacobsson
88.
by graphviz 7y ago
Can't some reasonable person refresh our website so we would have more useful content like this? :-) also include Sketchviz https://news.ycombinator.com/item?id=21518152 don't include anything from haters though
89.
by graphviz 7y ago
Thanks! A lot of the good stuff (e.g. stress majorization and the Jaccard distance model stolen for neato -Gmodel=subset) was done in the 2000s. Probably people criticize because they see B&W graphics, Times-Roman and splines rendered
90.
by graphviz 7y ago
What?

More ›