First time here? Check out the FAQ!

Ask Your Question
0

Graph plotting not working properly

asked 2 years ago

vidyarthi gravatar image

updated 2 years ago

slelievre gravatar image

Consider the following code:

def Sier(g):
    h = Graph()
    for i in range(1, g.order() + 1):
        perm = {u: (i, u) for u in g}
        gg = g.relabel(perm=perm, inplace=False)
        h.add_edges(gg.edges())
    return h

f = Sier(graphs.CompleteGraph(4))
v = f.vertices()
n1 = [((a, b), (b, a)) for a, b in v]
n2 = [(a, a), (a, a)) for a, b in v]
x = set(n1) - set(n2)
z = f.add_edges(x)
z.plot()

The plot function does not give the graph I desire. The size() function gives the size correctly. But the diagram is incorrect. Why is this? Any workarounds to make it precise?

Preview: (hide)

Comments

The plot function does not give the graph I desire.

What do you desire, exactly ?

Sorry, I'm not a psychiatrist. I'm just running H sapiens sapiens L. v 1.0, without psychic interface. And my aging dvinatory abilities do leave something to desire...

Emmanuel Charpentier gravatar imageEmmanuel Charpentier ( 2 years ago )

@Emmanuel Charpentier The plot function above gives me a disconnected graph with less number of edges, quite different from the desired size

vidyarthi gravatar imagevidyarthi ( 2 years ago )

1 Answer

Sort by » oldest newest most voted
0

answered 2 years ago

ortollj gravatar image

updated 2 years ago

Hi @vidyarthi

I try to guess, maybe this graph?

def Sier(g):
    h = Graph()
    for i in range(1, g.order() + 1):
        perm = {u: (i, u) for u in g}
        gg = g.relabel(perm=perm, inplace=False)
        h.add_edges(gg.edges())
    return h
f=Sier(graphs.CompleteGraph(4))
v=f.vertices()
n1=[((a,b),(b,a)) for (a,b) in v]
n2=[((a,a),(a,a)) for (a,b) in v]
x=set(n1)-set(n2)
f.add_edges(x)
z=f
z.plot(figsize=14,vertex_size=1000)
Preview: (hide)
link

Comments

if not, like Emmanuel asked you we need precisions !

I guess @David Coudert answser will help you: editing digraph layout

ortollj gravatar imageortollj ( 2 years ago )

and check the construction of the Generalized Sierpinski graphs https://trac.sagemath.org/ticket/33854 (needs review)

David Coudert gravatar imageDavid Coudert ( 2 years ago )

@David Coudert yes, what I wanted in my above plot was the Generalized Sierpinski Graph. But, even after trying the code as given in the answer, I am unable to get my desired graph. My graph is connected, whereas the graph plotted is disconnected. And, moreover, the size of graph does not match the construction.

vidyarthi gravatar imagevidyarthi ( 2 years ago )

Your Answer

Please start posting anonymously - your entry will be published after you log in or create a new account.

Add Answer

Question Tools

1 follower

Stats

Asked: 2 years ago

Seen: 412 times

Last updated: May 29 '22