20.07.2013 Views

Raport de cercetare - Lorentz JÄNTSCHI

Raport de cercetare - Lorentz JÄNTSCHI

Raport de cercetare - Lorentz JÄNTSCHI

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

}else{<br />

}<br />

}<br />

$this->tmp_dist=array();<br />

$mat_a=&$this->tmp_dist;<br />

$this->distance["v"][$i][$j]=array(<br />

$this->geometry["x"][$i]-$this->geometry["x"][$j],<br />

$this->geometry["y"][$i]-$this->geometry["y"][$j],<br />

$this->geometry["z"][$i]-$this->geometry["z"][$j]<br />

);<br />

$this->distance["g"][$i][$j]=pow(pow($this->distance["v"][$i][$j][0],2)+<br />

pow($this->distance["v"][$i][$j][1],2)+pow($this->distance["v"][$i][$j][2],2),0.5);<br />

$this->distance["v"][$i][$j][0]/=$this->distance["g"][$i][$j];<br />

$this->distance["v"][$i][$j][1]/=$this->distance["g"][$i][$j];<br />

$this->distance["v"][$i][$j][2]/=$this->distance["g"][$i][$j];<br />

$this->distance["v"][$j][$i]=array(<br />

-$this->distance["v"][$i][$j][0],<br />

-$this->distance["v"][$i][$j][1],<br />

-$this->distance["v"][$i][$j][2],<br />

);<br />

$this->distance["g"][$j][$i]=$this->distance["g"][$i][$j];<br />

}<br />

for($i=0;$in;$i++){<br />

for($j=0;$jm+1;<br />

}<br />

$mat[$i][$i]=0;<br />

for($j=$i+1;$jn;$j++){<br />

$mat[$i][$j]=$this->m+1;<br />

}<br />

}<br />

foreach($edges as $i => &$v){<br />

foreach($edges[$i] as $j => &$v){<br />

$mat[$i][$edges[$i][$j]]=1;<br />

}<br />

}<br />

for($k=0;$kn;$k++){<br />

for($i=0;$in;$i++){<br />

for($j=0;$jn;$j++){<br />

if($mat[$i][$k]+$mat[$k][$j]adjcency=array();<br />

$mat_a=&$this->adjcency;<br />

for($i=0;$in;$i++){<br />

$mat[$i]=array_fill(0,$this->n,0);<br />

}<br />

foreach($this->topology["edges"] as $i => &$v){<br />

foreach($this->topology["edges"][$i] as $j => &$v){<br />

$mat[$i][$this->topology["edges"][$i][$j]]=1;<br />

}<br />

}<br />

$mat_a=$mat;<br />

}<br />

function create_fragments(){<br />

for($vi=0;$vin;$vi++){<br />

$this->tmp_edge=$this->topology["edges"];<br />

$this->tmp_edve_cut($vi);<br />

$this->create_matrix_distance($this->tmp_edge);<br />

$chek_list=array_keys($this->tmp_dist);<br />

$i=0;$n_i=$this->n;<br />

do{<br />

$fr[$i][0]=$chek_list[0];<br />

for($j=1;$jtmp_dist[$fr[$i][0]][$chek_list[$j]]m){<br />

$fr[$i][]=$chek_list[$j];<br />

unset($chek_list[$j]);<br />

}<br />

}<br />

unset($chek_list[0]);<br />

$n_i=count($chek_list);<br />

if(!$n_i)break;<br />

179

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!