9363
Comment:
|
9933
py3 print
|
Deletions are marked like this. | Additions are marked like this. |
Line 33: | Line 33: |
print docs[0:doc_ex_loc].replace('\n ','\n') | print(docs[0:doc_ex_loc].replace('\n ','\n')) |
Line 38: | Line 38: |
print "Invalid arguments, using default" | print("Invalid arguments, using default") |
Line 55: | Line 55: |
print graph | print(graph) |
Line 57: | Line 57: |
print "n = %s (number of vertices)"%n | print("n = %s (number of vertices)" % n) |
Line 61: | Line 61: |
print "n reduced to 8" | print("n reduced to 8") |
Line 63: | Line 63: |
print "n = %s (dimension)"%n | print("n = %s (dimension)" % n) |
Line 66: | Line 66: |
print "n = %s (number of vertices)"%n print "p = %s%% (edge probability)"%p G = graphs.RandomGNP(n, p/100.0) print G.automorphism_group() |
print("n = %s (number of vertices)" % n) print("p = %s%% (edge probability)" % p) G = graphs.RandomGNP(n, p / 100.0) print(G.automorphism_group()) |
Line 98: | Line 98: |
def animate_contraction(g, e, frames = 12, **kwds): v1, v2 = e if not g.has_edge(v1,v2): raise ValueError, "Given edge not found on Graph" ls = [] posd = g.get_pos() for j in range(frames): gp = Graph(g) posdp = dict(posd) p1 = posdp[v1] p2 = posdp[v2] posdp[v2] = [a*(frames-j)/frames + b*j/frames for a,b in zip(p2,p1)] gp.set_pos(posdp) ls.append(plot(gp, **kwds)) return ls |
|
Line 234: | Line 252: |
g = selector(graph_list.keys(), buttons = True), | g = selector(graph_list.keys(), buttons = True,default='CompleteGraph4'), |
Line 236: | Line 254: |
m = selector(graph_list.keys(), buttons = True), u3 = text_control(value='''? It is has, show it to me, |
m = selector(graph_list.keys(), buttons = True,default='CycleGraph4'), u3 = text_control(value='''? If it has, show it to me, |
Line 251: | Line 269: |
Sage Interactions - Graph Theory
goto interact main page
Contents
Graph Browser
by Marshall Hampton
Automorphism Groups of some Graphs
by William Stein:
View an induced subgraph
by Jason Grout
Animations of Graph Minors
by Pablo Angulo