Участник:VolkovNikita94: различия между версиями
Перейти к навигации
Перейти к поиску
(Исправление описания примеров визуализации. Добавлены XML файлы и исходники. Часть XML-файлов не откорректирована, части исходников не хват.) |
(Пока окончательная правка XML файлов) |
||
| Строка 196: | Строка 196: | ||
<?xml version="1.0" encoding="UTF-8"?> | <?xml version="1.0" encoding="UTF-8"?> | ||
<algograph version="0.0.1"> | <algograph version="0.0.1"> | ||
| − | + | <algorithm num_ext_params="1" num_groups="2"> | |
| − | + | <ext_param name="n"/> | |
| − | + | <group id="0" num_or_parts="1" num_oper="1"> | |
| − | + | <or_part id="0" num_and_parts="1"> | |
| − | + | <and_part id="0"><![CDATA[]]></and_part> | |
| − | + | <statement id="0" num_inputs="1"> | |
| − | + | <input id="0" num_solutions="0"/> | |
| − | + | </statement> | |
| − | + | </or_part> | |
| − | + | </group> | |
| − | + | <loop> | |
| − | + | <loop> | |
| − | + | <group id="1" num_or_parts="1" num_oper="1"> | |
| − | + | <or_part id="0" num_and_parts="4"> | |
| − | + | <and_part id="0"><![CDATA[-i1<=-1]]></and_part> | |
| − | + | <and_part id="1"><![CDATA[i1<=n]]></and_part> | |
| − | + | <and_part id="2"><![CDATA[-i2<=-1]]></and_part> | |
| − | + | <and_part id="3"><![CDATA[i2<=n]]></and_part> | |
| − | + | <statement id="0" num_inputs="3"> | |
| − | + | <input id="0" num_solutions="0"/> | |
| − | + | <input id="1" num_solutions="3"> | |
| − | + | <solution num_altareas="1" group_id="1" or_part_id="0" statement_id="0" dimsolut="2"> | |
| − | + | <altarea num_conditions="5"> | |
| − | + | <condition><![CDATA[i2-n<=0]]></condition> | |
| − | + | <condition><![CDATA[-n+2<=0]]></condition> | |
| − | + | <condition><![CDATA[i1-n<=0]]></condition> | |
| − | + | <condition><![CDATA[-i1+1<=0]]></condition> | |
| − | + | <condition><![CDATA[-i2+2<=0]]></condition> | |
| − | + | </altarea> | |
| − | + | <dependency> | |
| − | + | <coordinate><![CDATA[i1]]></coordinate> | |
| − | + | <coordinate><![CDATA[i2-1]]></coordinate> | |
| − | + | </dependency> | |
| − | + | </solution> | |
| − | + | <solution num_altareas="1" group_id="1" or_part_id="0" statement_id="0" dimsolut="2"> | |
| − | + | <altarea num_conditions="5"> | |
| − | + | <condition><![CDATA[i2-n<=0]]></condition> | |
| − | + | <condition><![CDATA[-n+2<=0]]></condition> | |
| − | + | <condition><![CDATA[i1-n<=0]]></condition> | |
| − | + | <condition><![CDATA[-i1+2<=0]]></condition> | |
| − | + | <condition><![CDATA[-i2+1<=0]]></condition> | |
| − | + | </altarea> | |
| − | + | <dependency> | |
| − | + | <coordinate><![CDATA[i1-1]]></coordinate> | |
| − | + | <coordinate><![CDATA[i2]]></coordinate> | |
| − | + | </dependency> | |
| − | + | </solution> | |
| − | + | <solution num_altareas="1" group_id="0" or_part_id="0" statement_id="0" dimsolut="0"> | |
| − | + | <altarea num_conditions="5"> | |
| − | + | <condition><![CDATA[-n+1<=0]]></condition> | |
| − | + | <condition><![CDATA[-i2+1<=0]]></condition> | |
| − | + | <condition><![CDATA[-i1+1<=0]]></condition> | |
| − | + | <condition><![CDATA[i2-1<=0]]></condition> | |
| − | + | <condition><![CDATA[i1-1<=0]]></condition> | |
| − | + | </altarea> | |
| − | + | </solution> | |
| − | + | </input> | |
| − | + | <input id="2" num_solutions="0"/> | |
| − | + | </statement> | |
| − | + | </or_part> | |
| − | + | </group> | |
| − | + | </loop> | |
| − | + | </loop> | |
| − | + | </algorithm> | |
</algograph> | </algograph> | ||
</source> | </source> | ||
| Строка 276: | Строка 276: | ||
<?xml version="1.0" encoding="UTF-8"?> | <?xml version="1.0" encoding="UTF-8"?> | ||
<algograph version="0.0.1"> | <algograph version="0.0.1"> | ||
| − | + | <algorithm num_ext_params="1" num_groups="2"> | |
| − | + | <ext_param name="n"/> | |
| − | + | <group id="0" num_or_parts="1" num_oper="1"> | |
| − | + | <or_part id="0" num_and_parts="1"> | |
| − | + | <and_part id="0"><![CDATA[]]></and_part> | |
| − | + | <statement id="0" num_inputs="1"> | |
| − | + | <input id="0" num_solutions="0"/> | |
| − | + | </statement> | |
| − | + | </or_part> | |
| − | + | </group> | |
| − | + | <loop> | |
| − | + | <loop> | |
| − | + | <group id="1" num_or_parts="1" num_oper="1"> | |
| − | + | <or_part id="0" num_and_parts="4"> | |
| − | + | <and_part id="0"><![CDATA[-i1<=-1]]></and_part> | |
| − | + | <and_part id="1"><![CDATA[i1<=n]]></and_part> | |
| − | + | <and_part id="2"><![CDATA[-i2<=-1]]></and_part> | |
| − | + | <and_part id="3"><![CDATA[i2<=n]]></and_part> | |
| − | + | <statement id="0" num_inputs="3"> | |
| − | + | <input id="0" num_solutions="0"/> | |
| − | + | <input id="1" num_solutions="3"> | |
| − | + | <solution num_altareas="1" group_id="1" or_part_id="0" statement_id="0" dimsolut="2"> | |
| − | + | <altarea num_conditions="5"> | |
| − | + | <condition><![CDATA[i2-n<=0]]></condition> | |
| − | + | <condition><![CDATA[-n+2<=0]]></condition> | |
| − | + | <condition><![CDATA[i1-n<=0]]></condition> | |
| − | + | <condition><![CDATA[-i1+1<=0]]></condition> | |
| − | + | <condition><![CDATA[-i2+2<=0]]></condition> | |
| − | + | </altarea> | |
| − | + | <dependency> | |
| − | + | <coordinate><![CDATA[i1]]></coordinate> | |
| − | + | <coordinate><![CDATA[i2-1]]></coordinate> | |
| − | + | </dependency> | |
| − | + | </solution> | |
| − | + | <solution num_altareas="1" group_id="1" or_part_id="0" statement_id="0" dimsolut="2"> | |
| − | + | <altarea num_conditions="5"> | |
| − | + | <condition><![CDATA[i2-n<=0]]></condition> | |
| − | + | <condition><![CDATA[-n+2<=0]]></condition> | |
| − | + | <condition><![CDATA[i1-n<=0]]></condition> | |
| − | + | <condition><![CDATA[-i1+3<=0]]></condition> | |
| − | + | <condition><![CDATA[-i2+2<=0]]></condition> | |
| − | + | </altarea> | |
| − | + | <dependency> | |
| − | + | <coordinate><![CDATA[i1-2]]></coordinate> | |
| − | + | <coordinate><![CDATA[i2-1]]></coordinate> | |
| − | + | </dependency> | |
| − | + | </solution> | |
| − | + | <solution num_altareas="1" group_id="0" or_part_id="0" statement_id="0" dimsolut="0"> | |
| − | + | <altarea num_conditions="5"> | |
| − | + | <condition><![CDATA[-n+1<=0]]></condition> | |
| − | + | <condition><![CDATA[-i2+1<=0]]></condition> | |
| − | + | <condition><![CDATA[-i1+1<=0]]></condition> | |
| − | + | <condition><![CDATA[i2-1<=0]]></condition> | |
| − | + | <condition><![CDATA[i1-n<=0]]></condition> | |
| − | + | </altarea> | |
| − | + | </solution> | |
| − | + | </input> | |
| − | + | <input id="2" num_solutions="0"/> | |
| − | + | </statement> | |
| − | + | </or_part> | |
| − | + | </group> | |
| − | + | </loop> | |
| − | + | </loop> | |
| − | + | </algorithm> | |
</algograph> | </algograph> | ||
</source> | </source> | ||
| Строка 356: | Строка 356: | ||
<?xml version="1.0" encoding="UTF-8"?> | <?xml version="1.0" encoding="UTF-8"?> | ||
<algograph version="0.0.1"> | <algograph version="0.0.1"> | ||
| − | + | <algorithm num_ext_params="1" num_groups="2"> | |
| − | + | <ext_param name="n"/> | |
| − | + | <group id="0" num_or_parts="1" num_oper="1"> | |
| − | + | <or_part id="0" num_and_parts="1"> | |
| − | + | <and_part id="0"><![CDATA[]]></and_part> | |
| − | + | <statement id="0" num_inputs="1"> | |
| − | + | <input id="0" num_solutions="0"/> | |
| − | + | </statement> | |
| − | + | </or_part> | |
| − | + | </group> | |
| − | + | <loop> | |
| − | + | <loop> | |
| − | + | <group id="1" num_or_parts="1" num_oper="1"> | |
| − | + | <or_part id="0" num_and_parts="4"> | |
| − | + | <and_part id="0"><![CDATA[-i1<=-1]]></and_part> | |
| − | + | <and_part id="1"><![CDATA[i1<=n]]></and_part> | |
| − | + | <and_part id="2"><![CDATA[-i2<=-1]]></and_part> | |
| − | + | <and_part id="3"><![CDATA[i2<=n]]></and_part> | |
| − | + | <statement id="0" num_inputs="3"> | |
| − | + | <input id="0" num_solutions="0"/> | |
| − | + | <input id="1" num_solutions="5"> | |
| − | + | <solution num_altareas="1" group_id="1" or_part_id="0" statement_id="0" dimsolut="2"> | |
| − | + | <altarea num_conditions="5"> | |
| − | + | <condition><![CDATA[i2-n<=0]]></condition> | |
| − | + | <condition><![CDATA[-n+2<=0]]></condition> | |
| − | + | <condition><![CDATA[i1-n<=0]]></condition> | |
| − | + | <condition><![CDATA[-i1+1<=0]]></condition> | |
| − | + | <condition><![CDATA[-i2+2<=0]]></condition> | |
| − | + | </altarea> | |
| − | + | <dependency> | |
| − | + | <coordinate><![CDATA[i1]]></coordinate> | |
| − | + | <coordinate><![CDATA[i2-1]]></coordinate> | |
| − | + | </dependency> | |
| − | + | </solution> | |
| − | + | <solution num_altareas="1" group_id="1" or_part_id="0" statement_id="0" dimsolut="2"> | |
| − | + | <altarea num_conditions="5"> | |
| − | + | <condition><![CDATA[i2-n<=0]]></condition> | |
| − | + | <condition><![CDATA[-n+2<=0]]></condition> | |
| − | + | <condition><![CDATA[i1-n<=0]]></condition> | |
| − | + | <condition><![CDATA[-i2+1<=0]]></condition> | |
| − | + | <condition><![CDATA[-i1+2<=0]]></condition> | |
| − | + | </altarea> | |
| − | + | <dependency> | |
| − | + | <coordinate><![CDATA[i1-1]]></coordinate> | |
| − | + | <coordinate><![CDATA[i2]]></coordinate> | |
| − | + | </dependency> | |
| − | + | </solution> | |
| − | + | <solution num_altareas="1" group_id="1" or_part_id="0" statement_id="0" dimsolut="2"> | |
| − | + | <altarea num_conditions="5"> | |
| − | + | <condition><![CDATA[i2-n<=0]]></condition> | |
| − | + | <condition><![CDATA[-n+2<=0]]></condition> | |
| − | + | <condition><![CDATA[i1-n<=0]]></condition> | |
| − | + | <condition><![CDATA[-i1+1<=0]]></condition> | |
| − | + | <condition><![CDATA[-i2+3<=0]]></condition> | |
| − | + | </altarea> | |
| − | + | <dependency> | |
| − | + | <coordinate><![CDATA[i1]]></coordinate> | |
| − | + | <coordinate><![CDATA[1]]></coordinate> | |
| − | + | </dependency> | |
| − | + | </solution> | |
| − | + | <solution num_altareas="1" group_id="1" or_part_id="0" statement_id="0" dimsolut="2"> | |
| − | + | <altarea num_conditions="5"> | |
| − | + | <condition><![CDATA[i2-n<=0]]></condition> | |
| − | + | <condition><![CDATA[-n+2<=0]]></condition> | |
| − | + | <condition><![CDATA[i1-n<=0]]></condition> | |
| − | + | <condition><![CDATA[-i2+1<=0]]></condition> | |
| − | + | <condition><![CDATA[-i1+3<=0]]></condition> | |
| − | + | </altarea> | |
| − | + | <dependency> | |
| − | + | <coordinate><![CDATA[1]]></coordinate> | |
| − | + | <coordinate><![CDATA[i2]]></coordinate> | |
| − | + | </dependency> | |
| − | + | </solution> | |
| − | + | <solution num_altareas="1" group_id="0" or_part_id="0" statement_id="0" dimsolut="0"> | |
| − | + | <altarea num_conditions="5"> | |
| − | + | <condition><![CDATA[-n+1<=0]]></condition> | |
| − | + | <condition><![CDATA[-i2+1<=0]]></condition> | |
| − | + | <condition><![CDATA[-i1+1<=0]]></condition> | |
| − | + | <condition><![CDATA[i2-1<=0]]></condition> | |
| − | + | <condition><![CDATA[i1-n<=0]]></condition> | |
| − | + | </altarea> | |
| − | + | </solution> | |
| − | + | </input> | |
| − | + | <input id="2" num_solutions="0"/> | |
| − | + | </statement> | |
| − | + | </or_part> | |
| − | + | </group> | |
| − | + | </loop> | |
| − | + | </loop> | |
| − | + | </algorithm> | |
</algograph> | </algograph> | ||
</source> | </source> | ||
| Строка 462: | Строка 462: | ||
<?xml version="1.0" encoding="UTF-8"?> | <?xml version="1.0" encoding="UTF-8"?> | ||
<algograph version="0.0.1"> | <algograph version="0.0.1"> | ||
| − | + | <algorithm num_ext_params="2" num_groups="2"> | |
| − | + | <ext_param name="n"/> | |
| − | + | <ext_param name="m"/> | |
| − | + | <group id="0" num_or_parts="1" num_oper="1"> | |
| − | + | <or_part id="0" num_and_parts="1"> | |
| − | + | <and_part id="0"><![CDATA[]]></and_part> | |
| − | + | <statement id="0" num_inputs="1"> | |
| − | + | <input id="0" num_solutions="0"/> | |
| − | + | </statement> | |
| − | + | </or_part> | |
| − | + | </group> | |
| − | + | <loop> | |
| − | + | <loop> | |
| − | + | <loop> | |
| − | + | <group id="1" num_or_parts="1" num_oper="1"> | |
| − | + | <or_part id="0" num_and_parts="6"> | |
| − | + | <and_part id="0"><![CDATA[-i1<=-1]]></and_part> | |
| − | + | <and_part id="1"><![CDATA[i1<=n]]></and_part> | |
| − | + | <and_part id="2"><![CDATA[-i2<=-1]]></and_part> | |
| − | + | <and_part id="3"><![CDATA[i2<=m]]></and_part> | |
| − | + | <and_part id="4"><![CDATA[i3>=0]]></and_part> | |
| − | + | <and_part id="5"><![CDATA[i3<=n-1]]></and_part> | |
| − | + | <input id="0" num_solutions="0"/> | |
| − | + | <input id="1" num_solutions="3"> | |
| − | + | <solution num_altareas="1" group_id="1" or_part_id="0" statement_id="0" dimsolut="3"> | |
| − | + | <altarea num_conditions="7"> | |
| − | + | <condition><![CDATA[-m+2<=0]]></condition> | |
| − | + | <condition><![CDATA[i1-n<=0]]></condition> | |
| − | + | <condition><![CDATA[i3-n+1<=0]]></condition> | |
| − | + | <condition><![CDATA[-i2+2<=0]]></condition> | |
| − | + | <condition><![CDATA[i2<=m]]></condition> | |
| − | + | <condition><![CDATA[-i1+1<=0]]></condition> | |
| − | + | <condition><![CDATA[-i3<=0]]></condition> | |
| − | + | </altarea> | |
| − | + | <dependency> | |
| − | + | <coordinate><![CDATA[i1]]></coordinate> | |
| − | + | <coordinate><![CDATA[i2-1]]></coordinate> | |
| − | + | <coordinate><![CDATA[i3]]></coordinate> | |
| − | + | </dependency> | |
| − | + | </solution> | |
| − | + | <solution num_altareas="1" group_id="1" or_part_id="0" statement_id="0" dimsolut="3"> | |
| − | + | <altarea num_conditions="7"> | |
| − | + | <condition><![CDATA[-m+2<=0]]></condition> | |
| − | + | <condition><![CDATA[i1-n<=0]]></condition> | |
| − | + | <condition><![CDATA[i3-n+1<=0]]></condition> | |
| − | + | <condition><![CDATA[-i2+2<=0]]></condition> | |
| − | + | <condition><![CDATA[i2<=m]]></condition> | |
| − | + | <condition><![CDATA[-i1+1<=0]]></condition> | |
| − | + | <condition><![CDATA[-i3<=0]]></condition> | |
| − | + | </altarea> | |
| − | + | <dependency> | |
| − | + | <coordinate><![CDATA[1]]></coordinate> | |
| − | + | <coordinate><![CDATA[i2-1]]></coordinate> | |
| − | + | <coordinate><![CDATA[i3]]></coordinate> | |
| − | + | </dependency> | |
| − | + | </solution> | |
| − | + | <solution num_altareas="1" group_id="0" or_part_id="0" statement_id="0" dimsolut="0"> | |
| − | + | <altarea num_conditions="6"> | |
| − | + | <condition><![CDATA[i2-1<=0]]></condition> | |
| − | + | <condition><![CDATA[i2-1>=0]]></condition> | |
| − | + | <condition><![CDATA[-i1+1<=0]]></condition> | |
| − | + | <condition><![CDATA[-i3<=0]]></condition> | |
| − | + | <condition><![CDATA[i1-n<=0]]></condition> | |
| − | + | <condition><![CDATA[i3-n+1<=0]]></condition> | |
| − | + | </altarea> | |
| − | + | </solution> | |
| − | + | </input> | |
| − | + | <input id="2" num_solutions="0"/> | |
| − | + | </statement> | |
| − | + | </or_part> | |
| − | + | </group> | |
| − | + | </loop> | |
| − | + | </loop> | |
| − | + | </loop> | |
| − | + | </algorithm> | |
| − | |||
</algograph> | </algograph> | ||
</source> | </source> | ||
| Строка 554: | Строка 553: | ||
<?xml version="1.0" encoding="UTF-8"?> | <?xml version="1.0" encoding="UTF-8"?> | ||
<algograph version="0.0.1"> | <algograph version="0.0.1"> | ||
| − | + | <algorithm num_ext_params="2" num_groups="2"> | |
| − | + | <ext_param name="n"/> | |
| − | + | <ext_param name="m"/> | |
| − | + | <group id="0" num_or_parts="1" num_oper="1"> | |
| − | + | <or_part id="0" num_and_parts="1"> | |
| − | + | <and_part id="0"><![CDATA[]]></and_part> | |
| − | + | <statement id="0" num_inputs="1"> | |
| − | + | <input id="0" num_solutions="0"/> | |
| − | + | </statement> | |
| − | + | </or_part> | |
| − | + | </group> | |
| − | + | <loop> | |
| − | + | <loop> | |
| − | + | <loop> | |
| − | + | <group id="1" num_or_parts="1" num_oper="1"> | |
| − | + | <or_part id="0" num_and_parts="6"> | |
| − | + | <and_part id="0"><![CDATA[-i1<=-1]]></and_part> | |
| − | + | <and_part id="1"><![CDATA[i1<=n]]></and_part> | |
| − | + | <and_part id="2"><![CDATA[-i2<=-1]]></and_part> | |
| − | + | <and_part id="3"><![CDATA[i2<=m]]></and_part> | |
| − | + | <and_part id="4"><![CDATA[i3>=0]]></and_part> | |
| − | + | <and_part id="5"><![CDATA[i3<=n-1]]></and_part> | |
| − | + | <statement id="0" num_inputs="3"> | |
| − | + | <input id="0" num_solutions="0"/> | |
| − | + | <input id="1" num_solutions="2"> | |
| − | + | <solution num_altareas="1" group_id="1" or_part_id="0" statement_id="0" dimsolut="3"> | |
| − | + | <altarea num_conditions="7"> | |
| − | + | <condition><![CDATA[-m+2<=0]]></condition> | |
| − | + | <condition><![CDATA[i1-n<=0]]></condition> | |
| − | + | <condition><![CDATA[i3-n+1<=0]]></condition> | |
| − | + | <condition><![CDATA[-i2+1<=0]]></condition> | |
| − | + | <condition><![CDATA[i2+1<=m]]></condition> | |
| − | + | <condition><![CDATA[-i1+1<=0]]></condition> | |
| − | + | <condition><![CDATA[-i3<=0]]></condition> | |
| − | + | </altarea> | |
| − | + | <dependency> | |
| − | + | <coordinate><![CDATA[i1]]></coordinate> | |
| − | + | <coordinate><![CDATA[i2+1]]></coordinate> | |
| − | + | <coordinate><![CDATA[i3]]></coordinate> | |
| − | + | </dependency> | |
| − | + | </solution> | |
| − | + | <solution num_altareas="1" group_id="0" or_part_id="0" statement_id="0" dimsolut="0"> | |
| − | + | <altarea num_conditions="6"> | |
| − | + | <condition><![CDATA[i2-m<=0]]></condition> | |
| − | + | <condition><![CDATA[i2-m>=0]]></condition> | |
| − | + | <condition><![CDATA[-i1+1<=0]]></condition> | |
| − | + | <condition><![CDATA[-i3<=0]]></condition> | |
| − | + | <condition><![CDATA[i1-n<=0]]></condition> | |
| − | + | <condition><![CDATA[i3-n+1<=0]]></condition> | |
| − | + | </altarea> | |
| − | + | </solution> | |
| − | + | </input> | |
| − | + | <input id="2" num_solutions="0"/> | |
| − | + | </statement> | |
| − | + | </or_part> | |
| − | + | </group> | |
| − | + | </loop> | |
| − | + | </loop> | |
| − | + | </loop> | |
| − | + | </algorithm> | |
</algograph> | </algograph> | ||
</source> | </source> | ||
Версия 22:47, 17 апреля 2019
Чисто последовательная структура в 2D-представлении (последовательное суммирование)
int seqSum(const std::vector<int>& _src)
{
int resSum = 0;
for (int srcId = 0; srcId < _src.size(); ++srcId)
{
resSum += _src[srcId];
}
return resSum;
}
<?xml version="1.0" encoding="UTF-8"?>
<algograph version="0.0.1">
<algorithm num_ext_params="1" num_groups="2">
<ext_param name="n"/>
<group id="0" num_or_parts="1" num_oper="1">
<or_part id="0" num_and_parts="1">
<and_part id="0"><![CDATA[]]></and_part>
<statement id="0" num_inputs="1">
<input id="0" num_solutions="0"/>
</statement>
</or_part>
</group>
<loop>
<loop>
<group id="1" num_or_parts="1" num_oper="1">
<or_part id="0" num_and_parts="4">
<and_part id="0"><![CDATA[-i1<=-1]]></and_part>
<and_part id="1"><![CDATA[i1<=n]]></and_part>
<and_part id="2"><![CDATA[-i2<=-1]]></and_part>
<and_part id="3"><![CDATA[i2<=n]]></and_part>
<statement id="0" num_inputs="3">
<input id="0" num_solutions="0"/>
<input id="1" num_solutions="3">
<solution num_altareas="1" group_id="1" or_part_id="0" statement_id="0" dimsolut="2">
<altarea num_conditions="5">
<condition><![CDATA[i2-n<=0]]></condition>
<condition><![CDATA[-n+2<=0]]></condition>
<condition><![CDATA[i1-n<=0]]></condition>
<condition><![CDATA[-i1+1<=0]]></condition>
<condition><![CDATA[-i2+2<=0]]></condition>
</altarea>
<dependency>
<coordinate><![CDATA[i1]]></coordinate>
<coordinate><![CDATA[i2-1]]></coordinate>
</dependency>
</solution>
<solution num_altareas="1" group_id="1" or_part_id="0" statement_id="0" dimsolut="2">
<altarea num_conditions="5">
<condition><![CDATA[-i2+1<=0]]></condition>
<condition><![CDATA[-n+2<=0]]></condition>
<condition><![CDATA[i1-n<=0]]></condition>
<condition><![CDATA[-i1+2<=0]]></condition>
<condition><![CDATA[i2-1<=0]]></condition>
</altarea>
<dependency>
<coordinate><![CDATA[i1-1]]></coordinate>
<coordinate><![CDATA[n]]></coordinate>
</dependency>
</solution>
<solution num_altareas="1" group_id="0" or_part_id="0" statement_id="0" dimsolut="0">
<altarea num_conditions="5">
<condition><![CDATA[-n+1<=0]]></condition>
<condition><![CDATA[-i2+1<=0]]></condition>
<condition><![CDATA[-i1+1<=0]]></condition>
<condition><![CDATA[i2-1<=0]]></condition>
<condition><![CDATA[i1-1<=0]]></condition>
</altarea>
</solution>
</input>
<input id="2" num_solutions="0"/>
</statement>
</or_part>
</group>
</loop>
</loop>
</algorithm>
</algograph>
Набор одномерных последовательных структур, независимых между собой - 2D вариант
void seqParSum(const std::vector<std::vector<int> >& _src, std::vector<int>& _res)
{
if (_src.size() != _res.size())
return;
for (int srcGrpId = 0; srcGrpId < _src.size(); ++srcGrpId)
{
for (int srcElId = 0; srcElId < _src[srcGrpId].size(); ++srcElId )
{
_res[srcGrpId] += _src[srcGrpId][srcElId];
}
}
return;
}
<?xml version="1.0" encoding="UTF-8"?>
<algograph version="0.0.1">
<algorithm num_ext_params="1" num_groups="2">
<ext_param name="n"/>
<group id="0" num_or_parts="1" num_oper="1">
<or_part id="0" num_and_parts="1">
<and_part id="0"><![CDATA[]]></and_part>
<statement id="0" num_inputs="1">
<input id="0" num_solutions="0"/>
</statement>
</or_part>
</group>
<loop>
<loop>
<group id="1" num_or_parts="1" num_oper="1">
<or_part id="0" num_and_parts="4">
<and_part id="0"><![CDATA[-i1<=-1]]></and_part>
<and_part id="1"><![CDATA[i1<=n]]></and_part>
<and_part id="2"><![CDATA[-i2<=-1]]></and_part>
<and_part id="3"><![CDATA[i2<=n]]></and_part>
<statement id="0" num_inputs="3">
<input id="0" num_solutions="0"/>
<input id="1" num_solutions="3">
<solution num_altareas="1" group_id="1" or_part_id="0" statement_id="0" dimsolut="2">
<altarea num_conditions="5">
<condition><![CDATA[i2-n<=0]]></condition>
<condition><![CDATA[-n+2<=0]]></condition>
<condition><![CDATA[i1-n<=0]]></condition>
<condition><![CDATA[-i1+1<=0]]></condition>
<condition><![CDATA[-i2+2<=0]]></condition>
</altarea>
<dependency>
<coordinate><![CDATA[i1]]></coordinate>
<coordinate><![CDATA[i2-1]]></coordinate>
</dependency>
</solution>
<solution num_altareas="1" group_id="1" or_part_id="0" statement_id="0" dimsolut="0">
<altarea num_conditions="5">
<condition><![CDATA[-i2+1<=0]]></condition>
<condition><![CDATA[-n+2<=0]]></condition>
<condition><![CDATA[i1-n<=0]]></condition>
<condition><![CDATA[-i1+2<=0]]></condition>
<condition><![CDATA[i2-1<=0]]></condition>
</altarea>
</solution>
<solution num_altareas="1" group_id="0" or_part_id="0" statement_id="0" dimsolut="0">
<altarea num_conditions="5">
<condition><![CDATA[-n+1<=0]]></condition>
<condition><![CDATA[-i2+1<=0]]></condition>
<condition><![CDATA[-i1+1<=0]]></condition>
<condition><![CDATA[i2-1<=0]]></condition>
<condition><![CDATA[i1-1<=0]]></condition>
</altarea>
</solution>
</input>
<input id="2" num_solutions="0"/>
</statement>
</or_part>
</group>
</loop>
</loop>
</algorithm>
</algograph>
Двумерная структура со скошенным параллелизмом
<?xml version="1.0" encoding="UTF-8"?>
<algograph version="0.0.1">
<algorithm num_ext_params="1" num_groups="2">
<ext_param name="n"/>
<group id="0" num_or_parts="1" num_oper="1">
<or_part id="0" num_and_parts="1">
<and_part id="0"><![CDATA[]]></and_part>
<statement id="0" num_inputs="1">
<input id="0" num_solutions="0"/>
</statement>
</or_part>
</group>
<loop>
<loop>
<group id="1" num_or_parts="1" num_oper="1">
<or_part id="0" num_and_parts="4">
<and_part id="0"><![CDATA[-i1<=-1]]></and_part>
<and_part id="1"><![CDATA[i1<=n]]></and_part>
<and_part id="2"><![CDATA[-i2<=-1]]></and_part>
<and_part id="3"><![CDATA[i2<=n]]></and_part>
<statement id="0" num_inputs="3">
<input id="0" num_solutions="0"/>
<input id="1" num_solutions="3">
<solution num_altareas="1" group_id="1" or_part_id="0" statement_id="0" dimsolut="2">
<altarea num_conditions="5">
<condition><![CDATA[i2-n<=0]]></condition>
<condition><![CDATA[-n+2<=0]]></condition>
<condition><![CDATA[i1-n<=0]]></condition>
<condition><![CDATA[-i1+1<=0]]></condition>
<condition><![CDATA[-i2+2<=0]]></condition>
</altarea>
<dependency>
<coordinate><![CDATA[i1]]></coordinate>
<coordinate><![CDATA[i2-1]]></coordinate>
</dependency>
</solution>
<solution num_altareas="1" group_id="1" or_part_id="0" statement_id="0" dimsolut="2">
<altarea num_conditions="5">
<condition><![CDATA[i2-n<=0]]></condition>
<condition><![CDATA[-n+2<=0]]></condition>
<condition><![CDATA[i1-n<=0]]></condition>
<condition><![CDATA[-i1+2<=0]]></condition>
<condition><![CDATA[-i2+1<=0]]></condition>
</altarea>
<dependency>
<coordinate><![CDATA[i1-1]]></coordinate>
<coordinate><![CDATA[i2]]></coordinate>
</dependency>
</solution>
<solution num_altareas="1" group_id="0" or_part_id="0" statement_id="0" dimsolut="0">
<altarea num_conditions="5">
<condition><![CDATA[-n+1<=0]]></condition>
<condition><![CDATA[-i2+1<=0]]></condition>
<condition><![CDATA[-i1+1<=0]]></condition>
<condition><![CDATA[i2-1<=0]]></condition>
<condition><![CDATA[i1-1<=0]]></condition>
</altarea>
</solution>
</input>
<input id="2" num_solutions="0"/>
</statement>
</or_part>
</group>
</loop>
</loop>
</algorithm>
</algograph>
Двумерная структура со скошенным параллелизмом и скошенной передачей данных
<?xml version="1.0" encoding="UTF-8"?>
<algograph version="0.0.1">
<algorithm num_ext_params="1" num_groups="2">
<ext_param name="n"/>
<group id="0" num_or_parts="1" num_oper="1">
<or_part id="0" num_and_parts="1">
<and_part id="0"><![CDATA[]]></and_part>
<statement id="0" num_inputs="1">
<input id="0" num_solutions="0"/>
</statement>
</or_part>
</group>
<loop>
<loop>
<group id="1" num_or_parts="1" num_oper="1">
<or_part id="0" num_and_parts="4">
<and_part id="0"><![CDATA[-i1<=-1]]></and_part>
<and_part id="1"><![CDATA[i1<=n]]></and_part>
<and_part id="2"><![CDATA[-i2<=-1]]></and_part>
<and_part id="3"><![CDATA[i2<=n]]></and_part>
<statement id="0" num_inputs="3">
<input id="0" num_solutions="0"/>
<input id="1" num_solutions="3">
<solution num_altareas="1" group_id="1" or_part_id="0" statement_id="0" dimsolut="2">
<altarea num_conditions="5">
<condition><![CDATA[i2-n<=0]]></condition>
<condition><![CDATA[-n+2<=0]]></condition>
<condition><![CDATA[i1-n<=0]]></condition>
<condition><![CDATA[-i1+1<=0]]></condition>
<condition><![CDATA[-i2+2<=0]]></condition>
</altarea>
<dependency>
<coordinate><![CDATA[i1]]></coordinate>
<coordinate><![CDATA[i2-1]]></coordinate>
</dependency>
</solution>
<solution num_altareas="1" group_id="1" or_part_id="0" statement_id="0" dimsolut="2">
<altarea num_conditions="5">
<condition><![CDATA[i2-n<=0]]></condition>
<condition><![CDATA[-n+2<=0]]></condition>
<condition><![CDATA[i1-n<=0]]></condition>
<condition><![CDATA[-i1+3<=0]]></condition>
<condition><![CDATA[-i2+2<=0]]></condition>
</altarea>
<dependency>
<coordinate><![CDATA[i1-2]]></coordinate>
<coordinate><![CDATA[i2-1]]></coordinate>
</dependency>
</solution>
<solution num_altareas="1" group_id="0" or_part_id="0" statement_id="0" dimsolut="0">
<altarea num_conditions="5">
<condition><![CDATA[-n+1<=0]]></condition>
<condition><![CDATA[-i2+1<=0]]></condition>
<condition><![CDATA[-i1+1<=0]]></condition>
<condition><![CDATA[i2-1<=0]]></condition>
<condition><![CDATA[i1-n<=0]]></condition>
</altarea>
</solution>
</input>
<input id="2" num_solutions="0"/>
</statement>
</or_part>
</group>
</loop>
</loop>
</algorithm>
</algograph>
Двумерная структура с квадратным параллелизмом и массовыми рассылками по каждому измерению
<?xml version="1.0" encoding="UTF-8"?>
<algograph version="0.0.1">
<algorithm num_ext_params="1" num_groups="2">
<ext_param name="n"/>
<group id="0" num_or_parts="1" num_oper="1">
<or_part id="0" num_and_parts="1">
<and_part id="0"><![CDATA[]]></and_part>
<statement id="0" num_inputs="1">
<input id="0" num_solutions="0"/>
</statement>
</or_part>
</group>
<loop>
<loop>
<group id="1" num_or_parts="1" num_oper="1">
<or_part id="0" num_and_parts="4">
<and_part id="0"><![CDATA[-i1<=-1]]></and_part>
<and_part id="1"><![CDATA[i1<=n]]></and_part>
<and_part id="2"><![CDATA[-i2<=-1]]></and_part>
<and_part id="3"><![CDATA[i2<=n]]></and_part>
<statement id="0" num_inputs="3">
<input id="0" num_solutions="0"/>
<input id="1" num_solutions="5">
<solution num_altareas="1" group_id="1" or_part_id="0" statement_id="0" dimsolut="2">
<altarea num_conditions="5">
<condition><![CDATA[i2-n<=0]]></condition>
<condition><![CDATA[-n+2<=0]]></condition>
<condition><![CDATA[i1-n<=0]]></condition>
<condition><![CDATA[-i1+1<=0]]></condition>
<condition><![CDATA[-i2+2<=0]]></condition>
</altarea>
<dependency>
<coordinate><![CDATA[i1]]></coordinate>
<coordinate><![CDATA[i2-1]]></coordinate>
</dependency>
</solution>
<solution num_altareas="1" group_id="1" or_part_id="0" statement_id="0" dimsolut="2">
<altarea num_conditions="5">
<condition><![CDATA[i2-n<=0]]></condition>
<condition><![CDATA[-n+2<=0]]></condition>
<condition><![CDATA[i1-n<=0]]></condition>
<condition><![CDATA[-i2+1<=0]]></condition>
<condition><![CDATA[-i1+2<=0]]></condition>
</altarea>
<dependency>
<coordinate><![CDATA[i1-1]]></coordinate>
<coordinate><![CDATA[i2]]></coordinate>
</dependency>
</solution>
<solution num_altareas="1" group_id="1" or_part_id="0" statement_id="0" dimsolut="2">
<altarea num_conditions="5">
<condition><![CDATA[i2-n<=0]]></condition>
<condition><![CDATA[-n+2<=0]]></condition>
<condition><![CDATA[i1-n<=0]]></condition>
<condition><![CDATA[-i1+1<=0]]></condition>
<condition><![CDATA[-i2+3<=0]]></condition>
</altarea>
<dependency>
<coordinate><![CDATA[i1]]></coordinate>
<coordinate><![CDATA[1]]></coordinate>
</dependency>
</solution>
<solution num_altareas="1" group_id="1" or_part_id="0" statement_id="0" dimsolut="2">
<altarea num_conditions="5">
<condition><![CDATA[i2-n<=0]]></condition>
<condition><![CDATA[-n+2<=0]]></condition>
<condition><![CDATA[i1-n<=0]]></condition>
<condition><![CDATA[-i2+1<=0]]></condition>
<condition><![CDATA[-i1+3<=0]]></condition>
</altarea>
<dependency>
<coordinate><![CDATA[1]]></coordinate>
<coordinate><![CDATA[i2]]></coordinate>
</dependency>
</solution>
<solution num_altareas="1" group_id="0" or_part_id="0" statement_id="0" dimsolut="0">
<altarea num_conditions="5">
<condition><![CDATA[-n+1<=0]]></condition>
<condition><![CDATA[-i2+1<=0]]></condition>
<condition><![CDATA[-i1+1<=0]]></condition>
<condition><![CDATA[i2-1<=0]]></condition>
<condition><![CDATA[i1-n<=0]]></condition>
</altarea>
</solution>
</input>
<input id="2" num_solutions="0"/>
</statement>
</or_part>
</group>
</loop>
</loop>
</algorithm>
</algograph>
Набор независимых последовательно-параллельных 2D-структур с массовой рассылкой данных в каждой
<?xml version="1.0" encoding="UTF-8"?>
<algograph version="0.0.1">
<algorithm num_ext_params="2" num_groups="2">
<ext_param name="n"/>
<ext_param name="m"/>
<group id="0" num_or_parts="1" num_oper="1">
<or_part id="0" num_and_parts="1">
<and_part id="0"><![CDATA[]]></and_part>
<statement id="0" num_inputs="1">
<input id="0" num_solutions="0"/>
</statement>
</or_part>
</group>
<loop>
<loop>
<loop>
<group id="1" num_or_parts="1" num_oper="1">
<or_part id="0" num_and_parts="6">
<and_part id="0"><![CDATA[-i1<=-1]]></and_part>
<and_part id="1"><![CDATA[i1<=n]]></and_part>
<and_part id="2"><![CDATA[-i2<=-1]]></and_part>
<and_part id="3"><![CDATA[i2<=m]]></and_part>
<and_part id="4"><![CDATA[i3>=0]]></and_part>
<and_part id="5"><![CDATA[i3<=n-1]]></and_part>
<input id="0" num_solutions="0"/>
<input id="1" num_solutions="3">
<solution num_altareas="1" group_id="1" or_part_id="0" statement_id="0" dimsolut="3">
<altarea num_conditions="7">
<condition><![CDATA[-m+2<=0]]></condition>
<condition><![CDATA[i1-n<=0]]></condition>
<condition><![CDATA[i3-n+1<=0]]></condition>
<condition><![CDATA[-i2+2<=0]]></condition>
<condition><![CDATA[i2<=m]]></condition>
<condition><![CDATA[-i1+1<=0]]></condition>
<condition><![CDATA[-i3<=0]]></condition>
</altarea>
<dependency>
<coordinate><![CDATA[i1]]></coordinate>
<coordinate><![CDATA[i2-1]]></coordinate>
<coordinate><![CDATA[i3]]></coordinate>
</dependency>
</solution>
<solution num_altareas="1" group_id="1" or_part_id="0" statement_id="0" dimsolut="3">
<altarea num_conditions="7">
<condition><![CDATA[-m+2<=0]]></condition>
<condition><![CDATA[i1-n<=0]]></condition>
<condition><![CDATA[i3-n+1<=0]]></condition>
<condition><![CDATA[-i2+2<=0]]></condition>
<condition><![CDATA[i2<=m]]></condition>
<condition><![CDATA[-i1+1<=0]]></condition>
<condition><![CDATA[-i3<=0]]></condition>
</altarea>
<dependency>
<coordinate><![CDATA[1]]></coordinate>
<coordinate><![CDATA[i2-1]]></coordinate>
<coordinate><![CDATA[i3]]></coordinate>
</dependency>
</solution>
<solution num_altareas="1" group_id="0" or_part_id="0" statement_id="0" dimsolut="0">
<altarea num_conditions="6">
<condition><![CDATA[i2-1<=0]]></condition>
<condition><![CDATA[i2-1>=0]]></condition>
<condition><![CDATA[-i1+1<=0]]></condition>
<condition><![CDATA[-i3<=0]]></condition>
<condition><![CDATA[i1-n<=0]]></condition>
<condition><![CDATA[i3-n+1<=0]]></condition>
</altarea>
</solution>
</input>
<input id="2" num_solutions="0"/>
</statement>
</or_part>
</group>
</loop>
</loop>
</loop>
</algorithm>
</algograph>
Набор одномерных последовательных структур, независимых между собой - 3D вариант
<?xml version="1.0" encoding="UTF-8"?>
<algograph version="0.0.1">
<algorithm num_ext_params="2" num_groups="2">
<ext_param name="n"/>
<ext_param name="m"/>
<group id="0" num_or_parts="1" num_oper="1">
<or_part id="0" num_and_parts="1">
<and_part id="0"><![CDATA[]]></and_part>
<statement id="0" num_inputs="1">
<input id="0" num_solutions="0"/>
</statement>
</or_part>
</group>
<loop>
<loop>
<loop>
<group id="1" num_or_parts="1" num_oper="1">
<or_part id="0" num_and_parts="6">
<and_part id="0"><![CDATA[-i1<=-1]]></and_part>
<and_part id="1"><![CDATA[i1<=n]]></and_part>
<and_part id="2"><![CDATA[-i2<=-1]]></and_part>
<and_part id="3"><![CDATA[i2<=m]]></and_part>
<and_part id="4"><![CDATA[i3>=0]]></and_part>
<and_part id="5"><![CDATA[i3<=n-1]]></and_part>
<statement id="0" num_inputs="3">
<input id="0" num_solutions="0"/>
<input id="1" num_solutions="2">
<solution num_altareas="1" group_id="1" or_part_id="0" statement_id="0" dimsolut="3">
<altarea num_conditions="7">
<condition><![CDATA[-m+2<=0]]></condition>
<condition><![CDATA[i1-n<=0]]></condition>
<condition><![CDATA[i3-n+1<=0]]></condition>
<condition><![CDATA[-i2+1<=0]]></condition>
<condition><![CDATA[i2+1<=m]]></condition>
<condition><![CDATA[-i1+1<=0]]></condition>
<condition><![CDATA[-i3<=0]]></condition>
</altarea>
<dependency>
<coordinate><![CDATA[i1]]></coordinate>
<coordinate><![CDATA[i2+1]]></coordinate>
<coordinate><![CDATA[i3]]></coordinate>
</dependency>
</solution>
<solution num_altareas="1" group_id="0" or_part_id="0" statement_id="0" dimsolut="0">
<altarea num_conditions="6">
<condition><![CDATA[i2-m<=0]]></condition>
<condition><![CDATA[i2-m>=0]]></condition>
<condition><![CDATA[-i1+1<=0]]></condition>
<condition><![CDATA[-i3<=0]]></condition>
<condition><![CDATA[i1-n<=0]]></condition>
<condition><![CDATA[i3-n+1<=0]]></condition>
</altarea>
</solution>
</input>
<input id="2" num_solutions="0"/>
</statement>
</or_part>
</group>
</loop>
</loop>
</loop>
</algorithm>
</algograph>
Пример массовой рассылки данных в 2D-структуре
Искуственный пример, демонстрирующий элементы визуализации
Последовательный набор 3D-структур, содержащих скошенный параллелизм
Пример массовой рассылки данных в 3D-структуре
Пример 3D-структуры с различными видами скошенного параллелизма
Последовательно-параллельное перемножение матриц
