I've always found it really hard to find a graph layout algorithm that
I've been happy with. I've always stuck with using the node positions
that were drawn on the input topology.
But this doesn't always work when you're visualising a live network.
I don't think it's your lack of understanding so much as it being a
reasonably challenging problem.
There was a recent Hacker News thread discussing this sort of graph
layout problem. It looks like dagre-d3 was popular
https://news.ycombinator.com/item?id=9325024 with some examples on
https://github.com/cpettitt/dagre-d3/wiki
It shouldn't be too hard to use this as the layout algorithm.
When you say leaf/spine, is there inherent structure there? Perhaps
using a hierarchical layout algorithm would help.
You could try turning down the radius of the multi-edge lines so
they're closer to straight lines and see if that helps. Let me know if
you're interested and I'll dig up the relevant code sample.
Font settings and other graphical settings are in the code at the
moment - there's no separate configuration file for these. It's all
driven by d3 so it's not too hard to tweak them.
The code isn't elegant at the moment. It could do with a cleanup at
some point. I haven't touched the code in a while since we switched
over to using a Cisco visualisation engine for VIRL.
Thanks
> --
> You received this message because you are subscribed to the Google Groups
> "AutoNetkit" group.
> To unsubscribe from this group and stop receiving emails from it, send an
> email to
autonetkit+...@googlegroups.com.
> For more options, visit
https://groups.google.com/d/optout.