seb/XM_40017
1
0
Fork 0
mirror of https://github.com/fverdugo/XM_40017.git synced 2025-12-29 18:28:31 +01:00
Code Issues Actions Packages Projects Releases Wiki Activity

build based on 20c92dc

Browse Source
This commit is contained in:
Documenter.jl
2024-10-01 05:36:40 +00:00
parent 1f3b2a4d2e
commit 208fed1dac
38 changed files with 86 additions and 86 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
dev/asp_src/index.html
View File

@@ -7573,7 +7573,7 @@ a.anchor-link {
<span class="k">function</span><span class="w"> </span><span class="n">q1_answer</span><span class="p">(</span><span class="n">bool</span><span class="p">)</span>
<span class="w"> </span><span class="n">bool</span><span class="w"> </span><span class="o">||</span><span class="w"> </span><span class="k">return</span>
<span class="w"> </span><span class="n">msg</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="s">"""</span>
<span class="s"> The we can change the loop order over i and j without changing the result. Rememeber:</span>
<span class="s"> Then we can change the loop order over i and j without changing the result. Remember:</span>
<span class="s"> </span>
<span class="s"> C[i,j] = min(C[i,j],C[i,k]+C[k,j])</span>
<span class="s"> </span>
@@ -8351,7 +8351,7 @@ send the pieces to all other ranks. This is done in the function below. We start
<span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="n">rank</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span>
<span class="w"> </span><span class="n">N</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">C</span><span class="p">,</span><span class="mi">1</span><span class="p">)</span>
<span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="n">mod</span><span class="p">(</span><span class="n">N</span><span class="p">,</span><span class="n">P</span><span class="p">)</span><span class="w"> </span><span class="o">!=</span><span class="mi">0</span>
<span class="w"> </span><span class="n">println</span><span class="p">(</span><span class="s">"N not multplie of P"</span><span class="p">)</span>
<span class="w"> </span><span class="n">println</span><span class="p">(</span><span class="s">"N not multiple of P"</span><span class="p">)</span>
<span class="w"> </span><span class="n">MPI</span><span class="o">.</span><span class="n">Abort</span><span class="p">(</span><span class="n">comm</span><span class="p">,</span><span class="o">-</span><span class="mi">1</span><span class="p">)</span>
<span class="w"> </span><span class="k">end</span>
<span class="w"> </span><span class="n">Nref</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="kt">Ref</span><span class="p">(</span><span class="n">N</span><span class="p">)</span>