# HG changeset patch
# User Frederic Chapoton <chapoton at math.univ-lyon1.fr>
# Date 1373274887 -7200
# Node ID 58cafce80e500fe638e65fedd35161fb4b4fccd1
# Parent a00210b2da29b6dc9b9c29759812499439883dae
trac 14547 review patch for mclaughlin graph
diff --git a/sage/graphs/generators/smallgraphs.py b/sage/graphs/generators/smallgraphs.py
a
|
b
|
def McLaughlinGraph(): |
2822 | 2822 | from sage.sets.set import Set |
2823 | 2823 | |
2824 | 2824 | blocks = WittDesign(23).blocks() |
2825 | | blocks = map(Set,blocks) |
2826 | | B = [b for b in blocks if 0 in b] |
| 2825 | blocks = map(Set, blocks) |
| 2826 | B = [b for b in blocks if 0 in b] |
2827 | 2827 | C = [b for b in blocks if not 0 in b] |
2828 | 2828 | g = graph.Graph() |
2829 | 2829 | for b in B: |
2830 | 2830 | for x in range(23): |
2831 | 2831 | if not x in b: |
2832 | | g.add_edge(b,x) |
| 2832 | g.add_edge(b, x) |
2833 | 2833 | |
2834 | 2834 | for b in C: |
2835 | 2835 | for x in b: |
2836 | | g.add_edge(b,x) |
2837 | | |
2838 | | for b,bb in combinations(B,2): |
2839 | | if len(b&bb) == 1: |
2840 | | g.add_edge(b,bb) |
2841 | | |
2842 | | for c,cc in combinations(C,2): |
2843 | | if len(c&cc) == 1: |
2844 | | g.add_edge(c,cc) |
| 2836 | g.add_edge(b, x) |
| 2837 | |
| 2838 | for b, bb in combinations(B, 2): |
| 2839 | if len(b & bb) == 1: |
| 2840 | g.add_edge(b, bb) |
| 2841 | |
| 2842 | for c, cc in combinations(C, 2): |
| 2843 | if len(c & cc) == 1: |
| 2844 | g.add_edge(c, cc) |
2845 | 2845 | |
2846 | 2846 | for b in B: |
2847 | 2847 | for c in C: |
2848 | | if len(b&c) == 3: |
2849 | | g.add_edge(b,c) |
| 2848 | if len(b & c) == 3: |
| 2849 | g.add_edge(b, c) |
2850 | 2850 | |
2851 | 2851 | g.relabel() |
2852 | 2852 | g.name("McLaughlin") |