Conversation
|
Thanks! |
|
Can you change this to use the G(n,m) model and add a comment that spells out that the method samples DAGs with the same number of vertices and edges uniformly? |
No it doesn't. More precisely: it can be called as |
|
Not sure what the best approach would be when dealing with this in the tutorial. Something like this should do the trick: layout, extd_graph = g.layout("sugiyama", return_extended_graph=True)
ig.plot(
extd_graph,
vertex_size = [20] * g.vcount() + [0] * (extd_graph.vcount() - g.vcount())
# the rest of arguments should be as they are in the current example
)but then we'd still need to hide the arrowheads on all the edges that point to a dummy vertex, otherwise we end up with extra arrowheads. So it's a bit too much code for my taste for a simple tutorial example. |
|
In C/igraph 0.11 we should develop conventions for returning edge routing information. The extended graph approach might not be the best fit for other algorithms. Once we have this in place, there can be a convention |
|
Indeed when we say "graph layout" casually we kind of mean "vertex layout", didn't think about that before. I agree with @szhorvat that some form of support for routing would be nice to have after the refactor. That would also need a special infrastructure on the plotting side, to automate the issues highlighted above |


Taking inspiration from #724, this adds a new tutorial on directed acyclic graphs.
I thought why not.