sage: L = list(graphs(5, lambda G: max(G.degree()) >= 2)) sage: len(L) 0 sage: L = list(graphs(5, lambda G: max(G.degree()) < 2)) sage: len(L) 3 sage: L = list(graphs(5)) sage: len(L) 34
![]() | 1 | initial version |
sage: L = list(graphs(5, lambda G: max(G.degree()) >= 2)) sage: len(L) 0 sage: L = list(graphs(5, lambda G: max(G.degree()) < 2)) sage: len(L) 3 sage: L = list(graphs(5)) sage: len(L) 34
![]() | 2 | No.2 Revision |
sage: L = list(graphs(5, lambda G: max(G.degree()) >= 2))
2))
sage: len(L)
len(L)
0
sage: L = list(graphs(5, lambda G: max(G.degree()) < 2))
2))
sage: len(L)
3
len(L)
3
sage: L = list(graphs(5))
list(graphs(5))
sage: len(L)
len(L)
34
![]() | 3 | No.3 Revision |
sage: L = list(graphs(5, lambda G: max(G.degree()) >= 2))
sage: len(L)
0
0
sage: L = list(graphs(5, lambda G: max(G.degree()) < 2))
sage: len(L)
3
sage: L = list(graphs(5))
sage: len(L)
34
![]() | 4 | No.4 Revision |
sage: L = list(graphs(5, lambda G: max(G.degree()) >= 2))2))
sage: len(L)
sage: len(L)
0
0
sage: L = list(graphs(5, lambda G: max(G.degree()) < 2))
2))
sage: len(L)
sage: len(L)
3
3
sage: L = list(graphs(5))
list(graphs(5))
sage: len(L)
sage: len(L)
34
34
![]() | 5 | No.5 Revision |
sage: L = list(graphs(5, lambda G: max(G.degree()) >= 2))
sage: len(L)
0
sage: L = list(graphs(5, lambda G: max(G.degree()) < 2))
sage: len(L)
3
sage: L = list(graphs(5))
sage: len(L)
34
![]() | 6 | retagged |
sage: L = list(graphs(5, lambda G: max(G.degree()) >= 2))
sage: len(L)
0
sage: L = list(graphs(5, lambda G: max(G.degree()) < 2))
sage: len(L)
3
sage: L = list(graphs(5))
sage: len(L)
34
![]() | 7 | retagged |
sage: L = list(graphs(5, lambda G: max(G.degree()) >= 2))
sage: len(L)
0
sage: L = list(graphs(5, lambda G: max(G.degree()) < 2))
sage: len(L)
3
sage: L = list(graphs(5))
sage: len(L)
34