Resistance network calculator: Difference between revisions

{{trans|Python}}

 

V (n, p) = (m.len, m[0].len)

L(i) 0 .< n

assert(is_equal(13/7, network(4*4, 0, 4*4-1, ‘0 1 1|1 2 1|2 3 1|4 5 1|5 6 1|6 7 1|8 9 1|9 10 1|10 11 1|12 13 1|13 14 1|14 15 1|0 4 1|4 8 1|8 12 1|1 5 1|5 9 1|9 13 1|2 6 1|6 10 1|10 14 1|3 7 1|7 11 1|11 15 1’)))

assert(is_equal(180 , network(4, 0, 3, ‘0 1 150|0 2 50|1 3 300|2 3 250’)))

 

=={{header|Go}}==

{{trans|Python}}

 

import (

fmt.Printf("%.6g\n", f)

}

 

{{out}}

=={{header|Julia}}==

{{trans|Python}}

n, p = length(m), length(m[1])

for i in 1:n

@assert(13//7 == network(4*4,0,4*4-1,"0 1 1|1 2 1|2 3 1|4 5 1|5 6 1|6 7 1|8 9 1|9 10 1|10 11 1|12 13 1|13 14 1|14 15 1|0 4 1|4 8 1|8 12 1|1 5 1|5 9 1|9 13 1|2 6 1|6 10 1|10 14 1|3 7 1|7 11 1|11 15 1"))

@assert(180 == network(4,0,3,"0 1 150|0 2 50|1 3 300|2 3 250"))

No assertion errors.

 

=={{header|Nim}}==

{{trans|Python}}

 

type Fraction = Rational[int]

assert 3 // 2 == network(3*3, 0, 3*3-1, "0 1 1|1 2 1|3 4 1|4 5 1|6 7 1|7 8 1|0 3 1|3 6 1|1 4 1|4 7 1|2 5 1|5 8 1")

assert 13 // 7 == network(4*4, 0, 4*4-1, "0 1 1|1 2 1|2 3 1|4 5 1|5 6 1|6 7 1|8 9 1|9 10 1|10 11 1|12 13 1|13 14 1|14 15 1|0 4 1|4 8 1|8 12 1|1 5 1|5 9 1|9 13 1|2 6 1|6 10 1|10 14 1|3 7 1|7 11 1|11 15 1")

 

{{out}}

 

=={{header|Perl}}==

use warnings;

 

printf "%10.3f\n", network(@$_);

}

{{out}}

<pre> 10.000

=={{header|Phix}}==

{{trans|Go}}

<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>

<span style="color: #008080;">function</span> <span style="color: #000000;">argmax</span><span style="color: #0000FF;">(</span><span style="color: #004080;">sequence</span> <span style="color: #000000;">m</span><span style="color: #0000FF;">,</span> <span style="color: #004080;">integer</span> <span style="color: #000000;">i</span><span style="color: #0000FF;">)</span>

<span style="color: #008000;">"0 4 1|4 8 1|8 12 1|1 5 1|5 9 1|9 13 1|2 6 1|6 10 1|10 14 1|3 7 1|7 11 1|11 15 1"</span><span style="color: #0000FF;">))</span>

<span style="color: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"%.6g\n"</span><span style="color: #0000FF;">,</span><span style="color: #000000;">network</span><span style="color: #0000FF;">(</span><span style="color: #000000;">4</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">0</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">3</span><span style="color: #0000FF;">,</span> <span style="color: #008000;">"0 1 150|0 2 50|1 3 300|2 3 250"</span><span style="color: #0000FF;">))</span>

{{out}}

<pre>

 

=={{header|Python}}==

 

def gauss(m):

assert 3/2 == network(3*3,0,3*3-1,"0 1 1|1 2 1|3 4 1|4 5 1|6 7 1|7 8 1|0 3 1|3 6 1|1 4 1|4 7 1|2 5 1|5 8 1")

assert Fraction(13,7) == network(4*4,0,4*4-1,"0 1 1|1 2 1|2 3 1|4 5 1|5 6 1|6 7 1|8 9 1|9 10 1|10 11 1|12 13 1|13 14 1|14 15 1|0 4 1|4 8 1|8 12 1|1 5 1|5 9 1|9 13 1|2 6 1|6 10 1|10 14 1|3 7 1|7 11 1|11 15 1")

 

=={{header|Raku}}==

(formerly Perl 6)

{{trans|Python}}

for @m.keys -> \i {

my \k = max |(i .. @m.end), :by({ @m[$_][i].abs });

;

plan +@tests;

 

=={{header|Wren}}==

{{trans|Go}}

{{libheader|Wren-fmt}}

 

var argmax = Fn.new { |m, i|

network.call(4, 0, 3, "0 1 150|0 2 50|1 3 300|2 3 250")

]

 

{{out}}

{{libheader|GSL}} GNU Scientific Library

This a tweak of [[Resistor_mesh#zkl]]

 

fcn network(n,k0,k1,mesh){

b[k1]=1;

A.AxEQb(b)[k1];

.println();

 

 

network(4,0,3,"0 1 150|0 2 50|1 3 300|2 3 250")

{{out}}

<pre>