Ramsey's theorem: Difference between revisions
m
→{{header|Wren}}: Minor tidy
(→{{header|jq}}: retract jaq line) |
m (→{{header|Wren}}: Minor tidy) |
||
(2 intermediate revisions by one other user not shown) | |||
Line 1,047:
{{works with|jq}}
'''Also works with gojq, the Go implementation of jq.'''
With a minor tweak of the line using string interpolation, the following program also works with jaq (as of April 13, 2023), the Rust implementation of jq.
In the following, if a is a connectivity matrix and if $i != $j,
Line 1,065 ⟶ 1,067:
| if $depth == $size
then (if $ctype == 0 then "un" else "" end) as $cs
| "Totally \($cs)connected group: " + (.idx | map(tostring) | join(" "))
else .i = $min
| until (.i >= $max or .emit;
Line 1,995 ⟶ 1,997:
{{trans|C}}
{{libheader|Wren-fmt}}
<syntaxhighlight lang="
var a = List.filled(17, null)
|