are you asking for euclidean distance between turtles?
http://ccl.northwestern.edu/netlogo/docs/dict/distance.html
2015-04-08 13:07 GMT+02:00 <s.mostafa.h....@gmail.com>:
> Hi All !
> I want to some help about K-Medoid in NetLogo . we need at least two
> indicator and I want to create two cluster . the Min Distanace between two
> point is the best Seletion .
>
> this is a pseudo Code for k-Medoids :
>
> for (int i =0 ; i<=NumberOfDataPoint ; i++)
> {
> for(int j=0 ; j<= NumberOfDataPoint ; j++)
> {
> distanceX[j] = Math.Pow ( Xcor[i] - Xcor[j] , 2 ) ;
> distanceY[j] = Math.Pow ( Ycor[i]-Ycor[j] , 2 ) ;
> distance[i] + = Math.Sqrt( distanceX[j] + distanceY[j] );
> }
> }
> return minimum distance[i];
> .....
> .....
> .....
>
>
> Thanks in advance to any help
> Regards
>
> --
> You received this message because you are subscribed to the Google Groups
> "netlogo-devel" group.
> To unsubscribe from this group and stop receiving emails from it, send an
> email to netlogo-devel+unsubscr...@googlegroups.com.
> For more options, visit https://groups.google.com/d/optout.
>
--
-----------------------------------------------------------------
Simone Gabbriellini, PhD
Post-doctoral Researcher
ANR founded research project "DIFFCERAM"
GEMASS, CNRS & Paris-Sorbonne.
mobile: +39 340 39 75 626
email: simone.gabbriell...@cnrs.fr
--
You received this message because you are subscribed to the Google Groups
"netlogo-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to netlogo-devel+unsubscr...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.
