Created
August 23, 2014 10:25
-
-
Save MHenderson/462eb071cb80151ad133 to your computer and use it in GitHub Desktop.
Filter Moore graphs from an input string of whitespace-delimited graphs in graph6 format.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/bin/bash | |
# Usage: | |
# echo `geng -qc 5` | moore.sh | |
# | |
# Note: Do not use for values greater than 6. | |
read g6raw | |
g6proc=$(echo $g6raw | | |
awk '{ print "\"" $1 "\"" "," }' RS=' ' ORS=' ' | | |
sed '$s/. $//') | |
g6list="["${g6proc}"]" | |
s=" | |
load(graphs)$ | |
moore1(G):= | |
( | |
K: max_degree(G)[1], | |
k: min_degree(G)[1], | |
d: diameter(G), | |
g: girth(G), | |
is_connected(G) and is(g = 2*d + 1 and k = K) | |
)$ | |
moore2(g):= | |
( | |
k: max_degree(g)[1], | |
d: diameter(g), | |
expected_order: 1 + k*(((k-1)^d - 1)/(k - 2)), | |
is(graph_order(g) = expected_order) | |
)$ | |
moore3(g):= | |
( | |
k: min_degree(g)[1], | |
d: (girth(g) - 1)/2, | |
expected_order: 1 + k*(((k-1)^d - 1)/(k - 2)), | |
is(graph_order(g) = expected_order) | |
)$ | |
g6list: $g6list$ | |
glist: map(graph6_decode, g6list)$ | |
moore_graphs: sublist(glist, moore1)$ | |
map(graph6_encode, moore_graphs); | |
" | |
maxima --very-quiet --batch-string="$s"\ | |
| tail -n 1\ | |
| tr -d ' \t\r\f[]'\ | |
| tr ',' '\n' |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment